Optimality and duality for minimax fractional programming with support function under (C,α,ρ,d)-convexity

Sufficient optimality conditions are established for a class of nondifferentiable generalized minimax fractional programming problem with support functions. Further, two dual models are considered and weak, strong and strict converse duality theorems are established under the assumptions of (C,α,ρ,d)-convexity. Results presented in this paper, generalizes several results from literature to more general model of the problems as well as for more general class of generalized convexity.