On the set of weakly efficient minimizers for convex multiobjective programming

On the set of weakly efficient minimizers for convex multiobjective programming

0.00 Avg rating0 Votes
Article ID: iaor20102867
Volume: 36
Issue: 5
Start Page Number: 651
End Page Number: 655
Publication Date: Sep 2008
Journal: Operations Research Letters
Authors: ,
Abstract:

In this paper by employing an asymptotic approach we develop an existence and stability theory for convex multiobjective programming. We deal with the set of weakly efficient minimizers. To this end we employ a notion of convergence for vector-valued functions close to that due to Lemaire.

Reviews

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