On well-posedness and Hausdorff convergence of solution sets of vector optimization problems
From MaRDI portal
Publication:438791
DOI10.1007/S10957-011-9947-7zbMATH Open1261.90050OpenAlexW2047094364MaRDI QIDQ438791FDOQ438791
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
Recommendations
- Existence and optimality conditions for approximate solutions to vector optimization problems
- Well-posedness and convexity in vector optimization
- Characterization of solutions of multiobjective optimization problem
- Well-posedness and scalarization in vector optimization
- Scalarization of Levitin-Polyak well-posedness in vector optimization using weak efficiency
- Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
- Well-posedness and stability in vector optimization problems using Henig proper efficiency
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
- Well posedness in vector optimization problems and vector variational inequalities
- Well-posedness for vector equilibrium problems
Cites Work
- Vector optimization. Set-valued and variational analysis.
- Well-posed optimization problems
- Well-posedness and scalarization in vector optimization
- Well posedness in vector optimization problems and vector variational inequalities
- On Approximate Solutions in Convex Vector Optimization
- Coercivity properties and well-posedness in vector optimization
- Weak Sharp Minima in Multicriteria Linear Programming
- Weak sharp minima for piecewise linear multiobjective optimization in normed spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- Title not available (Why is that?)
- Piecewise linear vector optimization problems on locally convex Hausdorff topological vector spaces
- Tykhonov well-posedness for quasi-equilibrium problems
- Levitin-Polyak well-posedness for constrained quasiconvex vector optimization problems
- An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization
- Well Posed Optimization Problems and Nonconvex Chebyshev Sets in Hilbert Spaces
This page was built for publication: On well-posedness and Hausdorff convergence of solution sets of vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438791)
