Well-posedness and convexity in vector optimization

Well-posedness and convexity in vector optimization

0.00 Avg rating0 Votes
Article ID: iaor20051131
Country: Germany
Volume: 58
Issue: 3
Start Page Number: 375
End Page Number: 385
Publication Date: Jan 2003
Journal: Mathematical Methods of Operations Research (Heidelberg)
Authors: ,
Abstract:

We study a notion of well-posedness in vector optimization through the behaviour of minimizing sequences of sets, defined in terms of Hausdorff set-convergence. We show that the notion of strict efficiency is related to the notion of well-posedness. Using the obtained results we identify a class of well-posed vector optimization problems: the convex problems with compact efficient frontiers.

Reviews

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