Abstract
We establish the Kuhn-Tucker necessary and sufficient conditions for an efficient optimum of multiobjective fractional programming problems containing ($si:F$esi:ρ)-convex functions. Bector type dual for multiobjective fractional programming problem is introduced and certain duality results have been derived in the framework of ($si:F$esi:ρ)-convex functions.
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
