Well-posedness and convexity in vector optimization

E. Miglierina () and E. Molho ()

Mathematical Methods of Operations Research, 2003, vol. 58, issue 3, 375-385

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. Copyright Springer-Verlag 2003

Keywords: Vector optimization; Well-posedness; Stability; Hausdorff set-convergence (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations: View citations in EconPapers (16)

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860300310 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:58:y:2003:i:3:p:375-385

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860300310

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().