Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency
From MaRDI portal
Publication:779866
DOI10.1007/s10957-020-01683-0zbMath1447.90072OpenAlexW3035871225MaRDI QIDQ779866
Meenakshi Gupta, Manjari K. Srivastava
Publication date: 14 July 2020
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-020-01683-0
Sensitivity, stability, parametric optimization (90C31) Programming in abstract spaces (90C48) Robustness in mathematical programming (90C17)
Related Items (5)
Image space analysis for set optimization problems with applications ⋮ Approximate solutions for set optimization with an order cone that has nonempty quasirelative interiors ⋮ Characterizations of multi-objective robustness solutions defined by Minkowski set difference ⋮ An unified scalarization and Ekeland's variational principle for partial set order ⋮ Levitin-Polyak well-posedness in set optimization concerning Pareto efficiency
Cites Work
- Generalized \(B\)-well-posedness for set optimization problems
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- Well-posed optimization problems
- Extended well-posedness of quasiconvex vector optimization problems
- Well-posedness for set optimization problems
- Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
- \(\epsilon\)-solutions in vector minimization problems
- Partial order relations on family of sets and scalarizations for set optimization
- Pointwise and global well-posedness in set optimization: a direct approach
- Characterizations of generalized Levitin-Polyak well-posed set optimization problems
- Approximate solutions of vector optimization problems via improvement sets in real linear spaces
- Scalarization method for Levitin-Polyak well-posedness of vectorial optimization problems
- Scalarization of Levitin-Polyak well-posedness in vector optimization using weak efficiency
- A note on semicontinuity of the solution mapping for parametric set optimization problems
- Scalarizations for a set optimization problem using generalized oriented distance function
- Characterizations of multiobjective robustness via oriented distance function and image space analysis
- Well-posedness and scalarization in set optimization involving ordering cones with possibly empty interior
- Set Optimization—A Rather Short Introduction
- Set-valued optimization in welfare economics
- Approximate solutions and scalarization in set-valued optimization
- External and internal stability in set optimization
- Set-valued Optimization
- Set-valued analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency
