Min-ordering and max-ordering scalarization methods for multi-objective robust optimization
From MaRDI portal
Recommendations
- Scalarization of multiobjective robust optimization problems
- Robustness to uncertain optimization using scalarization techniques and relations to multiobjective optimization
- Generalized multiobjective robustness and relations to set-valued optimization
- Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
- On robust multiobjective optimization
Cites work
- scientific article; zbMATH DE number 3568375 (Why is no real title available?)
- A discussion of scalarization techniques for multiple objective integer programming
- Adjustable robust solutions of uncertain linear programs
- Bi-objective robust optimisation
- Concepts of robustness for uncertain multi-objective optimization
- Dominance for multi-objective robust optimization concepts
- Extensions of labeling algorithms for multi-objective uncertain shortest path problems
- Geometric methods to solve max-ordering location problems
- Minmax robustness for multi-objective optimization problems
- Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
- Multicriteria Optimization
- Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization
- On robust multiobjective optimization
- Robust convex optimization
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Robust multiobjective optimization \& applications in portfolio optimization
- Robust optimization
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
- Solving min-max shortest-path problems on a network
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
Cited in
(6)- A Vectorization Scheme for Nonconvex Set Optimization Problems
- A steepest descent method for set optimization problems with set-valued mappings of finite cardinality
- The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems
- Research trends in combinatorial optimization
- Approximate cutting plane approaches for exact solutions to robust optimization problems
- scientific article; zbMATH DE number 7071081 (Why is no real title available?)
This page was built for publication: Min-ordering and max-ordering scalarization methods for multi-objective robust optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1713738)
