In this paper we will show that the closely K-convexlike vector-valued functions with K Rm a nonempty convex cone and related classes of vector-valued functions discussed in the literature arise naturally within the theory of biconjugate functions applied to the Lagrangian perturbation scheme in finite dimensional optimization. For these classes of vectorvalued functions an equivalent characterization of the dual objective function associated with the Lagrangian is derived by means of a dual representation of the relative interior of a convex cone. It turns out that these characterizations are strongly related to the closely convexlike and Ky-Fan convex bifunctions occurring within minimax problems. Also it is shown for a general class of finite dimensional optimization problems that strong Lagrangian duality holds in case a vector-valued function related to the functions in this optimization problem is closely K-convexlike and satisfies some additional regularity condition.

Lagrangian duality
Mathematical Methods and Programming: Other (jel C69), Business Administration and Business Economics; Marketing; Accounting (jel M), Production Management (jel M11), Transportation Systems (jel R4)
Erasmus Research Institute of Management
hdl.handle.net/1765/1931
ERIM Report Series Research in Management
ERIM report series research in management Erasmus Research Institute of Management
Erasmus Research Institute of Management

Frenk, J.B.G, & Kassay, G. (2005). Lagrangian duality and cone convexlike functions (No. ERS-2005-019-LIS). ERIM report series research in management Erasmus Research Institute of Management. Erasmus Research Institute of Management. Retrieved from http://hdl.handle.net/1765/1931