MINIMAX PROGRAMMING WITH $(G, \ALPHA)$-INVEXTY
Keywords:
(G, α)-invexity, minimax programming, optimal solution, G-Kuhn-Tucker necessary optimality conditionsAbstract
In this paper, we deal with the minimax programming (P) under the differentiable $(G, \alpha)$-invexity which was proposed in [J. Nonlinear Anal. Optim. 2(2): 305-315]. With the help of auxiliary programming problem $(G-P)$, some new Kuhn-Tucker necessary conditions, namely for G-Kuhn-Tucker necessary conditions, is presented for the minimax programming (P). Also G-Karush-Kuhn-Tucker sufficient conditions under $(G, \alpha)$-invexity assumption are obtained for the minimax programming (P). Making use of these optimality conditions, we construct a dual problem (DI) for (P) and establish weak, strong and strict converse duality theorems between problems (P)and (DI).
Additional Files
Published
Issue
Section
License
Copyright (c) 2024 Journal of Nonlinear Analysis and Optimization: Theory & Applications (JNAO)
![Creative Commons License](http://i.creativecommons.org/l/by-nc-nd/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
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.