Lagrange multipliers and saddle points in multiobjective programming (Q1337207)

This paper presents some characterizations of ``subconvexlike'' vector functions, that is, functions which are convexlike with respect to the interior of the underlying ordering cone. Then it provides existence conditions for Lagrange multipliers of a subconvexlike multiobjective problem and for weak saddle points of the associated Lagrange function.