Second-Order Duality for Continuous Programming Containing Support Functions

A second-order dual problem is formulated for a class of continuous programming problem in which both objective and constrained functions contain support functions, hence it is nondifferentiable. Under second-order invexity and second-order pseudoinvexity, weak, strong and converse duality theorems are established for this pair of dual problems. Special cases are deduced and a pair of dual continuous problems with natural boundary values is constructed. A close relationship between duality results of our problems and those of the corresponding (static) nonlinear programming problem with support functions is briefly outlined.