On well-posedness and Hausdorff convergence of solution sets of vector optimization problems

DOI10.1007/s10957-011-9947-7zbMath1261.90050OpenAlexW2047094364MaRDI QIDQ438791

Sien Deng, Laura J. Kettner

Publication date: 31 July 2012

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-011-9947-7

zbMATH Keywords

vector optimizationwell-posednessHausdorff distanceweakly efficient solution

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (3)

An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization ⋮ Levitin-Polyak well-posedness for constrained quasiconvex vector optimization problems ⋮ Tykhonov well-posedness for quasi-equilibrium problems

Cites Work

• Unnamed Item
• Unnamed Item
• Well-posed optimization problems
• Well-posedness and scalarization in vector optimization
• Weak sharp minima for piecewise linear multiobjective optimization in normed spaces
• Well posedness in vector optimization problems and vector variational inequalities
• Vector optimization. Set-valued and variational analysis.
• On Approximate Solutions in Convex Vector Optimization
• Coercivity properties and well-posedness in vector optimization
• Weak Sharp Minima in Multicriteria Linear Programming

This page was built for publication: On well-posedness and Hausdorff convergence of solution sets of vector optimization problems