Sufficiency and duality in nondifferentiable minimax fractional programming with (Hp,r)(Hp,r)-invexity

In the present paper, we discuss the optimality condition for an optimal solution to the problem and a dual model is formulated for a non differentiable minimax fractional programming problem. Weak, strong and strict converse duality results are concerned involving (Hp,r)(Hp,r)-invexity.