Optimality conditions for a nondifferentiable minimax programming in complex spaces

In this paper we study a nondifferentiable minimax programming in complex spaces. We establish the Kuhn–Tucker type necessary optimality conditions, and prove the existence theorem for optimality in complex programming under generalized convexity.