Complex nonlinear programming: duality with invexity and equivalent real programs
Journal of Optimization Theory and Applications
Complex minimax programming under generalized convexity
Journal of Computational and Applied Mathematics
Generalized α-invexity and nondifferentiable minimax fractional programming
Journal of Computational and Applied Mathematics
Nondifferentiable minimax fractional programming in complex spaces with parametric duality
Journal of Global Optimization
Hi-index | 0.09 |
We establish the Kuhn-Tucker type sufficient optimality conditions for complex minimax programming under generalized Type-I and related functions. Subsequently, we apply these optimality criteria to formulate two dual models. We also establish weak, strong, and strict converse duality theorems.