Abstract
We establish the necessary and sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems solving generalized convex functions. Subsequently, we apply the optimality conditions to formulate one parametric dual problem and we prove weak duality, strong duality, and strict converse duality theorems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have