Abstract
In this paper we present numerous sets of global parametric sufficient optimality conditions and duality results under various generalized (F, ρ, θ) -convexity assumptions for a discrete minmax fractional subset programming problem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
