Complex minimax programming under generalized convexity

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.