OPTIMALITY CONDITIONS FOR MINIMAX PROGRAMMING OF ANALYTIC FUNCTIONS
H.C. Lai, J. C. Chen J. C. Chen · Taiwanese Journal of Mathematics · 2004
In this paper, we investigate a minimax complex programming problem. Several sufficient Optimality conditions are established under the framework of generalized convexity for analytic functions. Employing the sufficient optimality conditions, we have proved the weak, strong and strict converse duality theorems for the complex minimax programming problem.