Abstract
We establish the Kuhn–Tucker necessary and sufficient conditions for an efficient optimum of nonsmooth multiobjective fractional programming problems containing pseudo–invex functions. Bector type dual for multiobjective fractional programming problem is introduced and certain duality results have been derived in the framework of pseudo–invex functions
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
