On sufficiency and duration in nonsmooth multiobjective programming

On sufficiency and duration in nonsmooth multiobjective programming

0.00 Avg rating0 Votes
Article ID: iaor1999416
Country: India
Volume: 34
Issue: 4
Start Page Number: 221
End Page Number: 231
Publication Date: Dec 1997
Journal: OPSEARCH
Authors:
Abstract:

A nonsmooth multiobjective programming problem is considered and Karush–Kuhn–Tucker type sufficient conditions are derived for properly efficient solutions. Weak and strong duality results are established for Mond–Weir type dual. These results are obtained under generalized convexity assumptions.

Reviews

Required fields are marked *. Your email address will not be published.