(<i>G, V</i>)-invexity nondifferentiable generalized minimax fractional programming

In this paper, we study the nondifferentiable generalized minimax fractional programming problem under ( G, V )-invexity. G -sufficient optimality conditions for the considered nondifferentiable generalized minimax fractional programming problem are established under the concept of ( G, V )-invexity. Further, two types of dual models are formulated and G -duality theorems relating to the primal minimax fractional programming problem and dual problems are established. These results extend several known results to a wider class of programs.