Generalized convexity and duality for multiobjective optimization problems

0.00 Avg rating—0 Votes

Article ID:	iaor1994321
Country:	India
Volume:	13
Issue:	3
Start Page Number:	383
End Page Number:	390
Publication Date:	Sep 1992
Journal:	Journal of Information & Optimization Sciences
Authors:	Kim Do Sang
Keywords:	optimization, programming: nonlinear

Abstract:

The paper shows that the Kuhn-Tucker type conditions are sufficient for properly efficient solutions of the multiobjective generalized convex (F-convex) optimization problems. The duality relations for scalar generalized convex (F-convex) optimization problems are extended to vector values optimization problems.

Reviews

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