Ben-Israel, A., Ben-Tal, A. and Charnes, A. (1977) Necessary and Sufficient Conditions for a Pareto Optimum in Convex Programming. Econometrica, 45, 811-820.
https://doi.org/10.2307/1912673

has been cited by the following article:

• TITLE: Guignard’s Constraint Qualification (GCQ) and Multiobjective Optimisation Problems

  AUTHORS: H. S. Faruque Alam, Ganesh Chandra Ray

  KEYWORDS: Constraint Qualifications, Multiobjective Optimization, Karush Kuhn-Tucker Conditions, Constraint Optimization

  JOURNAL NAME: Journal of Applied Mathematics and Physics, Vol.10 No.7, July 29, 2022

  ABSTRACT: Investigation of optimality conditions has been one of the most interesting topics in the theory of multiobjective optimisation problems (MOP). To derive necessary optimality conditions of MOP, we consider assumptions called constraints qualifications. It is recognised that Guignard Constraint Qualification (GCQ) is the most efficient and general assumption for scalar objective optimisation problems; however, GCQ does not ensure Karush-Kuhn Tucker (KKT) necessary conditions for multiobjective optimisation problems. In this paper, we investigate the reasons behind that GCQ are not allowed to derive KKT conditions in multiobjective optimisation problems. Furthermore, we propose additional assumptions that allow one to use GCQ to derive necessary conditions for multiobjective optimisation problems. Finally, we also include sufficient conditions for multiobjective optimisation problems.