Robust efficiency and well-posedness in uncertain vector optimization problems
From MaRDI portal
Recommendations
- Robust counterparts and robust efficient solutions in vector optimization under uncertainty
- Well-posedness for the optimistic counterpart of uncertain vector optimization problems
- Necessary and sufficient conditions for robust minimal solutions in uncertain vector optimization
- Global well-posedness of set-valued optimization with application to uncertain problems
Cites work
- scientific article; zbMATH DE number 1377943 (Why is no real title available?)
- A scenario-based approach for robust linear optimization
- Adjustable robust solutions of uncertain linear programs
- Bi-objective robust optimisation
- Decision uncertainty in multiobjective optimization
- Discontinuous but Well‐Posed Optimization Problems
- Dominance for multi-objective robust optimization concepts
- Duality in robust optimization: Primal worst equals dual best
- Dynamic pricing and inventory control: robust vs. stochastic uncertainty models---a computational study
- Extended well-posedness of vector optimization problems: the convex case
- Generalized light robustness and the trade-off between robustness and nominal quality
- Generalized semicontinuity and existence theorems for cone saddle points
- Introduction to stochastic programming.
- Levitin-Polyak well-posedness for equilibrium problems with the lexicographic order
- Levitin-Polyak well-posedness in set optimization concerning Pareto efficiency
- Minmax robustness for multi-objective optimization problems
- Multicriteria Optimization
- Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization
- Necessary and sufficient conditions for robust minimal solutions in uncertain vector optimization
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- On robust multiobjective optimization
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Pointwise and global well-posedness in set optimization: a direct approach
- Quasiconvexity of set-valued maps assures well-posedness of robust vector optimization
- Recent Developments in Vector Optimization
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
- Robust Nash equilibria in vector-valued games with uncertainty
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Robust aspects of solutions in deterministic multiple objective linear programming
- Robust optimization
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- Scalarization of Levitin-Polyak well-posed set optimization problems
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
- Some generalizations of the Weierstrass theorem
- The relationship between multi-objective robustness concepts and set-valued optimization
- Tykhonov well-posedness for lexicographic equilibrium problems
- Well-Posedness for Lexicographic Vector Equilibrium Problems
- Well-posedness and scalarization in vector optimization
- Well-posedness for the optimistic counterpart of uncertain vector optimization problems
Cited in
(10)- Classification of vector optimization problems with uncertain factors
- Optimality conditions in uncertain multi-objective optimization problems with a variable domination structure
- Qualitative properties of robust Benson efficient solutions of uncertain vector optimization problems
- Robust duality for robust efficient solutions in uncertain vector optimization problems
- Well-posedness for the optimistic counterpart of uncertain vector optimization problems
- On global well-posedness of semi-infinite set optimization problems
- Robust nonsmooth optimality conditions for uncertain multiobjective programs involving stable functions
- External and internal stability for set optimization problems
- Characterization of norm-based robust solutions in vector optimization
- On the convergence of efficient solutions to semi-infinite set-optimization problems
This page was built for publication: Robust efficiency and well-posedness in uncertain vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5885204)
