Characterization of Properly Efficient Solutions for Convex Multiobjective Programming with Nondifferentiable vanishing constraints

This paper studies the convex multiobjective optimization problem with vanishing constraints‎. ‎We introduce a new constraint qualification for these problems‎, ‎and then a necessary optimality condition for properly efficient solutions is presented‎. ‎Finally by imposing some assumptions‎, ‎we show that our necessary condition is also sufficient for proper efficiency‎. ‎Our results are formulated in terms of convex subdifferential.

کلیدواژه ها:

Multiobjective optimization‎ ، ‎Vanishing constraints‎ ، ‎Convex optimization‎ ، ‎Constraint qualification