Abstract
We establish the sufficient conditions for generalized fractional programming from a viewpoint of the generalized convexity. When the sufficient conditions are utilized, the corresponding duality theorems are derived for two types of duals of the generalized fractional programming. We extend the corresponding results of several authors.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
