Duality in Minimax Fractional Programming Problem Involving Nonsmooth Generalized (F, α, ρ, d)-Convexity

Abstract: In this paper, we discuss nondifferentiable minimax fractional programming problem where the involved functions are locally Lipschitz. Furthermore, weak, strong and strict converse duality theorems are proved in the setting of Mond-Weir type dual under the assumption of generalized (F, α, ρ, d)-convexity