On Minimax Fractional Programming of Generalized Convex Set Functions1

We derive necessary and sufficient optimality conditions for the discrete mini- max programming problem with subdifferentiable I, r, u.-convex set functions. Then we apply these optimality criteria to construct two models of parameter-free dual problems and a third model of another dual problem. We also establish weak, strong, and strictly converse duality theorems