Duality relations for a nondifferentiable minimax fractional programming problem under generalized convexity

Abstract

In this article, we have studied a nondifferentiable minimax fractional programming problem under the generalized invexity. We have been formulated Wolfe, Mond-Weir and unified duals for a nondifferentiable fractional programming problem, where every component of objective function contains the square root terms of positive semidefinite. Appropriate duality results are proved involving $(V,\alpha,\rho,d)$-invex type-I functions. Results obtained in this paper naturally unify and extend some previously known results on non-differentiable minimax fractional programming in the literature.