Duality for a Minimax Programming Problem Containing n-Set Functions1

Parameter necessary and sufficient optimality conditions for the discrete minimax programming problem with differentiable n-set functions are established in Zalmai wOptimization 20 1989.377]395x. In this paper, we establish nonparameter necessary and sufficient optimality conditions. The nonparameter necessary optimality conditions suggest the establishment of two parameter-free duality models for the discrete minimax programming problem with differentiable n-set functions, and the weak, strong, and strict converse duality theorems have been derived.