Robust efficiency and well-posedness in uncertain vector optimization problems
From MaRDI portal
Publication:5885204
DOI10.1080/02331934.2022.2031189OpenAlexW4210594688MaRDI QIDQ5885204
Publication date: 3 April 2023
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2022.2031189
Sensitivity, stability, well-posedness (49K40) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Management decision making, including multiple objectives (90B50)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Minmax robustness for multi-objective optimization problems
- Bi-objective robust optimisation
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
- Generalized light robustness and the trade-off between robustness and nominal quality
- Extended well-posedness of vector optimization problems: the convex case
- Well-posedness for the optimistic counterpart of uncertain vector optimization problems
- Well-posedness and scalarization in vector optimization
- Duality in robust optimization: Primal worst equals dual best
- Generalized semicontinuity and existence theorems for cone saddle points
- Adjustable robust solutions of uncertain linear programs
- Dominance for multi-objective robust optimization concepts
- Decision uncertainty in multiobjective optimization
- Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization
- Pointwise and global well-posedness in set optimization: a direct approach
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- Levitin-Polyak well-posedness for equilibrium problems with the lexicographic order
- Levitin-Polyak well-posedness in set optimization concerning Pareto efficiency
- Robust Nash equilibria in vector-valued games with uncertainty
- Necessary and sufficient conditions for robust minimal solutions in uncertain vector optimization
- The relationship between multi-objective robustness concepts and set-valued optimization
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
- Robust aspects of solutions in deterministic multiple objective linear programming
- Quasiconvexity of set-valued maps assures well-posedness of robust vector optimization
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Dynamic pricing and inventory control: robust vs. stochastic uncertainty models---a computational study
- On robust multiobjective optimization
- Tykhonov well-posedness for lexicographic equilibrium problems
- Some Generalizations of the Weierstrass Theorem
- Scalarization of Levitin–Polyak well-posed set optimization problems
- A Scenario-Based Approach for Robust Linear Optimization
- Recent Developments in Vector Optimization
- Introduction to Stochastic Programming
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Multicriteria Optimization
- Well-Posedness for Lexicographic Vector Equilibrium Problems
- Discontinuous but Well‐Posed Optimization Problems
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
This page was built for publication: Robust efficiency and well-posedness in uncertain vector optimization problems
