Characterizations of multi-objective robustness solutions defined by Minkowski set difference
From MaRDI portal
Publication:6120607
DOI10.1007/s00291-023-00725-zMaRDI QIDQ6120607
Publication date: 21 February 2024
Published in: OR Spectrum (Search for Journal in Brave)
Cites Work
- Vectorization in set optimization
- Minmax robustness for multi-objective optimization problems
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- New order relations in set optimization
- Nonconvex separation theorems and some applications in vector optimization
- Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency
- Merit functions in vector optimization
- Characterizations for optimality conditions of general robust optimization problems
- Partial order relations on family of sets and scalarizations for set optimization
- A unified characterization of multiobjective robustness via separation
- Robust necessary optimality conditions for nondifferentiable complex fractional programming with uncertain data
- Continuity of solutions for parametric set optimization problems via scalarization methods
- Necessary and sufficient conditions for robust minimal solutions in uncertain vector optimization
- Characterizing robust solution sets of convex programs under data uncertainty
- The relationship between multi-objective robustness concepts and set-valued optimization
- A unified approach through image space analysis to robustness in uncertain optimization problems
- Three concepts of robust efficiency for uncertain multiobjective optimization problems via set order relations
- Scalarizations for a set optimization problem using generalized oriented distance function
- Characterizations of multiobjective robustness via oriented distance function and image space analysis
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Image space analysis for set optimization problems with applications
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data
- Optimality conditions of robust convex multiobjective optimization viaε-constraint scalarization and image space analysis
- Characterizations of robust optimality conditions via image space analysis
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
This page was built for publication: Characterizations of multi-objective robustness solutions defined by Minkowski set difference