Optimality Conditions for Vector Optimization Problems
In this paper, some necessary and sufficient optimality conditions for the weakly efficient solutions of vector optimization problems (VOP) with finite equality and inequality constraints are shown by using two kinds of constraints qualifications in terms of the MP subdifferential due to Ye. A partial calmness and a penalized problem for the (VOP) are introduced and then the equivalence between the weakly efficient solution of the (VOP) and the local minimum solution of its penalized problem is proved under the assumption of partial calmness.
KeywordsVector optimization problem Optimality condition Partial calmness Exact penalization MP subdifferential
Unable to display preview. Download preview PDF.
- 7.Luc, D.T.: Theory of Vector Optimization. Springer, Berlin (1989) Google Scholar
- 8.Yuan, D.H., Chinchuluun, A., Liu, X.L., Pardalos, P.M.: Optimality conditions and duality for multiobjective programming involving (C;α;ρ;d)-type I functions. In: Konnov, I.V., Luc, D.T., Rubinov, A.M. (eds.) Generalized Convexity and Related Topics. Lecture Notes in Economics and Mathematical Systems, vol. 583, pp. 73–87. Springer, Berlin (2007) CrossRefGoogle Scholar