Necessary and Sufficient Conditions for Efficiency Via Convexificators
- 368 Downloads
Based on the extended Ljusternik Theorem by Jiménez-Novo, necessary conditions for weak Pareto minimum of multiobjective programming problems involving inequality, equality and set constraints in terms of convexificators are established. Under assumptions on generalized convexity, necessary conditions for weak Pareto minimum become sufficient conditions.
KeywordsFritz John and Karush–Kuhn–Tucker necessary and sufficient conditions for weak Pareto minimum Upper and lower convexificators Upper regular convexificators Quasiconvex functions Scalarly K-asymptotic pseudoconvex functions
The author thanks the referees for their valuable comments and suggestions. This research was supported by National Foundation for Science and Technology Development of Vietnam.
- 1.Demyanov, V.F.: Convexification and concavification of a positively homogeneous function by the same family of linear functions. Universia di Pisa, Report 3, 208, 802 (1994) Google Scholar
- 10.Luu, D.V.: Convexificators and necessary conditions for efficiency. Optimization (2013, accepted for publication). doi: 10.1080/02331934.2011.648636