Computation of robust Pareto points
From MaRDI portal
Publication:1037270
DOI10.1504/IJCSM.2009.027876zbMATH Open1190.90177MaRDI QIDQ1037270FDOQ1037270
Authors: Michael Dellnitz, Katrin Witting 
Publication date: 13 November 2009
Published in: International Journal of Computing Science and Mathematics (Search for Journal in Brave)
Recommendations
- A variational approach to define robustness for parametric multiobjective optimization problems
- Biobjective robust optimization over the efficient set for Pareto set reduction
- Approximating the Pareto set of multiobjective linear programs via robust optimization
- Fast computation of equispaced Pareto manifolds and Pareto fronts for multiobjective optimization problems
- Bi-objective robust optimisation
Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31)
Cited In (10)
- Decision space robustness for multi-objective integer linear programming
- Gap-free computation of Pareto-points by quadratic scalarizations
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- The Directed Search Method for Unconstrained Parameter Dependent Multi-objective Optimization Problems
- Robust multiobjective optimization with application to Internet routing
- Structural properties of Pareto fronts: the occurrence of dents in classical and parametric multiobjective optimization problems
- On solving parametric multiobjective quadratic programs with parameters in general locations
- Robust solutions to multi-objective linear programs with uncertain data
- Supporting strategy selection in multiobjective decision problems under uncertainty and hidden requirements
- A variational approach to define robustness for parametric multiobjective optimization problems
This page was built for publication: Computation of robust Pareto points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1037270)
