Abstract
In the present paper we extend the classes of invex functions (Mishra, Wang and Lai [14]) to generalized α-invex and related functions in context of complex space and establish the Kuhn-Tucker type sufficient optimality conditions for complex minimax programming under aforesaid conditions. Subsequently, we apply these optimality criteria to formulate two dual models. We also establish weak, strong, and strict converse duality theorems.
Original language | English |
---|---|
Pages (from-to) | 357-368 |
Number of pages | 12 |
Journal | Journal of Nonlinear and Convex Analysis |
Volume | 11 |
Issue number | 2 |
Publication status | Published - Aug 2010 |
Externally published | Yes |
Keywords
- Complex minimax programming
- Duality
- α-Invexity
ASJC Scopus subject areas
- Analysis
- Geometry and Topology
- Control and Optimization
- Applied Mathematics