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

نویسندگان
Farahmand Rad, Shahriar ID 1
Kanzi, Nader ID 2
Shaker Ardakani, Javad ID 3

1 Department of Mathematics‎, ‎Payame Noor University (PNU)‎, ‎P.OBox‎, ‎19395-4679‎, ‎Tehran‎, ‎Iran.

2 Department of Mathematics‎, ‎Payame Noor University (PNU)‎, ‎P.OBox‎, ‎19395-4679‎, ‎Tehran‎, ‎Iran.

3 Department of Mathematics‎, ‎Payame Noor University (PNU)‎, ‎P.OBox‎, ‎19395-4679‎, ‎Tehran‎, ‎Iran.

doi
10.30473/coam.2019.42442.1094
چکیده

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