Parametric duality on minimax programming involving generalized convexity in complex space

In this paper we employ generalized convexity of complex functions to establish several sufficient optimality conditions for minimax programming in complex spaces. Using such criteria, we constitute a parametrical dual, and establish the weak, strong, and strict converse duality theorems in the framework.