Set-valued minimax programming problems under generalized cone convexity
The authors formulate KKT sufficient optimality conditions in terms of contingent epiderivatives for a set-valued constrained minimax optimization problem. The KKT system is the starting point for the formulation of a Mond-Weir, a Wolfe and a so-called mixed type dual problem. For each primal-dual pair weak, strong and converse duality theorems are provided.
scientific article; zbMATH DE number 6838825