OPTIMALITY CONDITIONS FOR (G, \alpha) INVEX MULTIOBJECTIVE PROGRAMMING
In this paper, a generalization of convexity, namely $(G, \alpha)$-invexity, is considered in the case of nonlinear multiobjective programming problems where the functions constituting vector optimization problems are differentiable. Two auxiliary programming problems are constructed to present the modified KuhnTucker necessary optimality conditions for (CVP). With the help of auxiliary programming problems (GCVP), the relation between (CVP) and (GCVP) is discussed; while with the help of ('GP), a new KuhnTucker necessary condition for (CVP) is presented. Furthermore, the sufficiency of the introduced G KarushKuhnTucker(GKuhnTucker) necessary optimality conditions, for nonconvex multiobjective programming problem involving $(G, \alpha)$-invex functions, is proved.
How to Cite
Copyright (c) 2010 Journal of Nonlinear Analysis and Optimization: Theory & Applications
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.