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.
Miglierina, E., Molho, E., Well-posedness and convexity in vector optimization, <<MATHEMATICAL METHODS OF OPERATIONS RESEARCH>>, 2003; 58 (3): 375-385. [doi:10.1007/s001860300310] [http://dx.medra.org/10.1007/s001860300310] [http://hdl.handle.net/10807/1830]
Well-posedness and convexity in vector optimization
Miglierina, Enrico;
2003
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.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
