Pareto efficiency in robust optimization: simplification from a new perspective
From MaRDI portal
Cites work
- A new dual-based cutting plane algorithm for nonlinear adjustable robust optimization
- A soft robust model for optimization under ambiguity
- A survey of adjustable robust optimization
- A survey of decision making and optimization under uncertainty
- Adjustable robust solutions of uncertain linear programs
- Characterization of norm-based robust solutions in vector optimization
- Comparison of some scalarization methods in multiobjective optimization
- Fuzzy Optimization, Decision-making and Operations Research
- scientific article; zbMATH DE number 5641435 (Why is no real title available?)
- scientific article; zbMATH DE number 3934760 (Why is no real title available?)
- scientific article; zbMATH DE number 897462 (Why is no real title available?)
- Introduction to stochastic programming.
- Inverse DEA under inter-temporal dependence using multiple-objective programming
- Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria
- Light robustness
- LR-NIMBUS: an interactive algorithm for uncertain multiobjective optimization with lightly robust efficient solutions
- Measure of efficiency in DEA with fuzzy input-output levels: a methodology for assessing, ranking and imposing of weights restrictions
- Minmax robustness for multi-objective optimization problems
- Multicriteria Optimization
- Pareto adaptive robust optimality via a Fourier-Motzkin elimination lens
- Pareto robust optimization on Euclidean vector spaces
- Recent advances in robust optimization: an overview
- Robust aspects of solutions in deterministic multiple objective linear programming
- Robust discrete optimization and network flows
- Robust optimization
- Robust optimization-methodology and applications
- Robust Solutions to Uncertain Semidefinite Programs
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- Robustness in deterministic multi-objective linear programming with respect to the relative interior and angle deviation
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Theory and applications of robust optimization
This page was built for publication: Pareto efficiency in robust optimization: simplification from a new perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7239760)