Abstract
A nonsmooth multiobjective programming problem is considered and Kuhn-Tucker type sufficient conditions are derived for properly efficiency solutions. Weak and strong duality results are established for Mon-Weir type dual. These results are obtained under generalized convexity assumptions.
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
