Scalarization and robustness in uncertain vector optimization problems: a non componentwise approach
From MaRDI portal
Publication:2079686
DOI10.1007/s10898-022-01142-2zbMath1501.90089OpenAlexW4213086323MaRDI QIDQ2079686
Elisa Caprari, Lorenzo Cerboni Baiardi, Elena Molho
Publication date: 30 September 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-022-01142-2
Related Items (3)
Conjugate duality in set optimization via nonlinear scalarization ⋮ On the study of multistage stochastic vector quasi-variational problems ⋮ Optimality and error bound for set optimization with application to uncertain multi-objective programming
Cites Work
- Unnamed Item
- Unnamed Item
- Minmax robustness for multi-objective optimization problems
- Nonconvex separation theorems and some applications in vector optimization
- Nonconvex scalarization in set optimization with set-valued maps
- Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization
- A unified approach to uncertain optimization
- Robust optimization-methodology and applications
- On set-valued optimization.
- Scalarization in set optimization with solid and nonsolid ordering cones
- A scalarization scheme for binary relations with applications to set-valued and robust optimization
- Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach
- The relationship between multi-objective robustness concepts and set-valued optimization
- Characterization of set relations through extensions of the oriented distance
- Scalarizations for a set optimization problem using generalized oriented distance function
- Characterizations of multiobjective robustness via oriented distance function and image space analysis
- On robust multiobjective optimization
- Robust multiobjective optimization \& applications in portfolio optimization
- Robust solutions to multi-objective linear programs with uncertain data
- Treatment of set order relations by means of a nonlinear scalarization functional: a full characterization
- A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals
- Adaptive Scalarization Methods in Multiobjective Optimization
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Degrees of Efficiency and Degrees of Minimality
- Existence theorems of set optimization with set-valued maps
- Characterizations of set order relations and constrained set optimization problems via oriented distance function
- A set scalarization function based on the oriented distance and relations with other set scalarizations
- Set-valued Optimization
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
This page was built for publication: Scalarization and robustness in uncertain vector optimization problems: a non componentwise approach
