Recommendations
- Minmax robustness for multi-objective optimization problems
- Biobjective robust optimization over the efficient set for Pareto set reduction
- On robust multiobjective optimization
- The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems
- Decision uncertainty in multiobjective optimization
Cites work
- scientific article; zbMATH DE number 2160609 (Why is no real title available?)
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- A comparison of solution strategies for biobjective shortest path problems
- Evolutionary Multi-Criterion Optimization
- Generalized light robustness and the trade-off between robustness and nominal quality
- Introduction to Stochastic Programming
- Label correcting methods to solve multicriteria shortest path problems
- Light robustness
- Linear Multiple Objective Problems with Interval Coefficients
- Minmax robustness for multi-objective optimization problems
- Mixed route strategies for the risk-averse shipment of hazardous materials
- Multicriteria Optimization
- On robust multiobjective optimization
- On the cardinality of the Pareto set in bicriteria shortest path problems
- On the convergence of descent methods for monotone variational inequalities
- Optimization over the efficient set: overview
- Robust aspects of solutions in deterministic multiple objective linear programming
- Robust convex optimization
- Robust multiobjective optimization \& applications in portfolio optimization
- Robust multiple objective game theory
- Robust optimization
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust solutions to multi-objective linear programs with uncertain data
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The Price of Robustness
- The relationship between multi-objective robustness concepts and set-valued optimization
Cited in
(27)- Bi-objective optimisation over a set of convex sub-problems
- On highly robust approximate solutions for nonsmooth convex optimizations with data uncertainty
- A biobjective approach to recoverable robustness based on location planning
- A bicriteria approach to robust optimization
- Characterizations of robust \(\varepsilon\)-quasi optimal solutions for nonsmooth optimization problems with uncertain data
- Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs
- The point-based robustness gap for uncertain multiobjective optimization
- On highly robust efficient solutions to uncertain multiobjective linear programs
- Robust multiobjective optimization with application to Internet routing
- The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems
- Biobjective robust simulation-based optimization for unconstrained problems
- Decision making in multiobjective optimization problems under uncertainty: balancing between robustness and quality
- LR-NIMBUS: an interactive algorithm for uncertain multiobjective optimization with lightly robust efficient solutions
- Dominance for multi-objective robust optimization concepts
- Robust efficiency and well-posedness in uncertain vector optimization problems
- Extensions of labeling algorithms for multi-objective uncertain shortest path problems
- Min-ordering and max-ordering scalarization methods for multi-objective robust optimization
- Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions
- Algorithm robust for the bicriteria discrete optimization problem
- On approximate optimality conditions for robust multi-objective convex optimization problems
- Bi-level optimization approach for robust mean-variance problems
- Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
- Biobjective robust optimization over the efficient set for Pareto set reduction
- Robust solutions to multi-objective linear programs with uncertain data
- Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach
- Computation of robust Pareto points
- A one-step worst-case optimal algorithm for bi-objective univariate optimization
This page was built for publication: Bi-objective robust optimisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322907)
