Optimality and duality for minimax fractional programming with support functions under B-(p,r)-Type I assumptions

In the paper, we consider generalized minimax fractional programming with support functions. We prove optimality conditions for such nonsmooth optimization problems and Schaible, Weir and Bector type weak, strong, converse and strictly converse duality results under $B\text{‐}(p,r)$ ‐Type I assumptions imposed on the functions constituting considered optimization problems and their duals. In this way, we extend the results existing in the literature for a new class of nonconvex generalized minimax fractional programming problems with support functions.