Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity (Q2370040): Difference between revisions

In this paper, a sufficient conditions for optimality of \((P)\) for a class of nondifferentiable minimax fractional programming problems involving \((F, \alpha, \rho, d)\)-convexity is established. Subsequently applying the optimality conditions, two types of weak, strong and strict converse dual problems are considered and corresponding duality theorems are proved.