Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity

From MaRDI portal
Publication:2370040





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.




Cited in
(55)








This page was built for publication: Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2370040)