Generalized Lagrange multiplier rule for non-convex vector optimization problems

In this paper a non-convex vector optimization problem among infinite-dimensional spaces is presented. In particular, a generalized Lagrange multiplier rule is formulated as a necessary and sufficient optimality condition for weakly minimal solutions of a constrained vector optimization problem, without requiring that the ordering cone that defines the inequality constraints has non-empty interior. This paper extends the result of Donato (J. Funct. Analysis 261 (2011), 2083–2093) to the general setting of vector optimization by introducing a constraint qualification assumption that involves the Frèchet differentiability of the maps and the tangent cone to the image set. Moreover, the constraint qualification is a necessary and sufficient condition for the Lagrange multiplier rule to hold.