Nondifferentiable minimax fractional programming under generalized univexity

In this paper, we are concerned with a nondifferentiable minimax fractional programming problem. We derive a Kuhn–Tucker-type sufficient optimality condition for an optimal solution to the problem and establish week, strong and converse duality theorems for the problem and its three different forms of dual problems. The results in this paper extend a few known results in the literature.