Abstract
We establish sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems involving (F, α, ρ, d)-convexity. Subsequently, we apply the optimality conditions to formulate two types of dual problems and prove appropriate 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