Optimality Conditions and Duality in Nondifferentiable Minimax Fractional Programming with Generalized Convexity

We establish sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems involving (F, α, ρ, d)-convexity. Subsequently, we apply the optimality conditions to formulate two types of dual problems and prove appropriate duality theorems. The authors thank the referee for valuable suggestions improving the presentation of the paper.