Complex minimax programming under generalized convexity

Authors:
S. K. Mishra;S. Y. Wang;K. K. Lai
Affiliations:
Department of Mathematics, Statistics & Computer Science, G.B. Pant University of Agriculture & Technology, Pantnagar 263 145, Dist. Udham Singh Nagar, UP, India;Institute of Systems Science, Academy of Mathematics and Systems, Sciences, Chinese Academy of Sciences, Beijing 100080, China;Department of Management Sciences, City University of Hong Kong, 83 Tat Chee Avenue, Hong Kong
Venue:
Journal of Computational and Applied Mathematics
Year:
2004

Citing 1
Cited 4

Complex nonlinear programming: duality with invexity and equivalent real programs

Journal of Optimization Theory and Applications

Generalized α-invexity and nondifferentiable minimax fractional programming

Journal of Computational and Applied Mathematics
Second-order duality in nondifferentiable minmax programming involving type-I functions

Journal of Computational and Applied Mathematics
Complex minimax programming under generalized type-I functions

Computers & Mathematics with Applications
Nondifferentiable minimax fractional programming in complex spaces with parametric duality

Journal of Global Optimization

Quantified Score

Hi-index	7.29

Visualization

Abstract

We establish the Kuhn-Tucker-type sufficient optimality conditions for complex minimax programming under generalized invex functions. Subsequently, we apply these optimality criteria to formulate two dual models. We also establish weak, strong and strict converse duality theorems.