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...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.展开更多
Five kinds of cones are introduced, which are used to establish the constraints qualifications, under which the generalized Kuhn-Tucker necessary conditions are developed for a class of generalized (h,φ)-differentiab...Five kinds of cones are introduced, which are used to establish the constraints qualifications, under which the generalized Kuhn-Tucker necessary conditions are developed for a class of generalized (h,φ)-differentiable single-objective and multiobjective programming problems by using Motzkin's alternative theorem and Ben-Tal generalized algebraic operations.展开更多
文摘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.
基金This research is supported by the National Natural Science Foundation of China Grant 10261006, the Foundation of Education Section of Excellent Doctorial Theses Grant 200217 and the Basic Theory Foundation of Nanchang University.
文摘Five kinds of cones are introduced, which are used to establish the constraints qualifications, under which the generalized Kuhn-Tucker necessary conditions are developed for a class of generalized (h,φ)-differentiable single-objective and multiobjective programming problems by using Motzkin's alternative theorem and Ben-Tal generalized algebraic operations.
