On well-posedness and Hausdorff convergence of solution sets of vector optimization problems
type: Item
instance of: scholarly article
title: On well-posedness and Hausdorff convergence of solution sets of vector optimization problems
zbMATH Open document ID: 1261.90050
author: Laura J. Kettner
author: Sien Deng
published in: Journal of Optimization Theory and Applications
publication date: 2012-07-31T00:00:00Z
review text: The paper considers well-posedness of vector optimization problems (VOP) of minimizing a function \(F(x)=(f_1(x), \ldots, f_l(x))\) subject to \(x \in X\), where \(f\) is continuous and \(X\) closed. The notion of exact and \(\epsilon\)-weakly efficient solutions (in an additive sense) is considered. Similarly, for the (weighted sum) scalarization of the vector optimization problem, optimal and \(\epsilon\)-approximate solutions are considered. Well-posedness of the (VOP) in terms of the Hausdorff distance is defined. The main results of the paper are: 1. The Hausdorff distance between \(\epsilon\)-approximate solutions of the weighted sum scalarization to the exact solution set converges to 0 if and only if the weighted sum scalarization is well-posed. 2. For a convex VOP such that the solution set of the weighted sum scalarization is nonempty for all weights and such that the weighted sum problem is well-posed over the weight set \(\Lambda\) then the VOP is well-posed. The presented results are stronger than those obtained by \textit{S. Deng} [RAIRO, Oper. Res. 37, No. 3, 195--208 (2003; Zbl 1070.90095)]. Examples are used to show that they are the strongest possible results.
reviewed by: Matthias Ehrgott
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 6062516
zbMATH Keywords: vector optimization
zbMATH Keywords: well-posedness
zbMATH Keywords: weakly efficient solution
zbMATH Keywords: Hausdorff distance
MaRDI profile type: Publication
full work available at URL: s10957-011-9947-7
OpenAlex ID: W2047094364
cites work: Coercivity properties and well-posedness in vector optimization
cites work: Well-posed optimization problems
cites work: Weak Sharp Minima in Multicriteria Linear Programming
cites work: Weak sharp minima for piecewise linear multiobjective optimization in normed spaces
cites work: Well-posedness and scalarization in vector optimization
cites work: Q3094208
cites work: Well posedness in vector optimization problems and vector variational inequalities
cites work: Q4252818
cites work: Vector optimization. Set-valued and variational analysis.
cites work: On Approximate Solutions in Convex Vector Optimization
DOI: 10.1007/S10957-011-9947-7
Recommended article: Existence and optimality conditions for approximate solutions to vector optimization problems
Recommended article: Well-posedness and convexity in vector optimization
Recommended article: Characterization of solutions of multiobjective optimization problem
Recommended article: Well-posedness and scalarization in vector optimization
Recommended article: Scalarization of Levitin-Polyak well-posedness in vector optimization using weak efficiency
Recommended article: Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
Recommended article: Well-posedness and stability in vector optimization problems using Henig proper efficiency
Recommended article: A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
Recommended article: Well posedness in vector optimization problems and vector variational inequalities
Recommended article: Well-posedness for vector equilibrium problems
description: scientific article; zbMATH DE number 6062516