Biobjective robust optimization over the efficient set for Pareto set reduction
DOI10.1016/J.EJOR.2016.01.017zbMATH Open1346.90736OpenAlexW2260221217MaRDI QIDQ322934FDOQ322934
Authors: Daniel Jornada, V. Jorge Leon
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.01.017
Recommendations
- Bi-objective robust optimisation
- Pareto efficiency in robust optimization
- Robustness analysis in multi-objective mathematical programming using Monte Carlo simulation
- The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems
- On robust multiobjective optimization
multiple objective programmingmultiple criteria analysisrobustness and sensitivity analysisPareto set reduction
Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Minimax problems in mathematical programming (90C47)
Cites Work
- Probability Inequalities for Sums of Bounded Random Variables
- Theory of multiobjective optimization
- Nonlinear multiobjective optimization
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- Theory and applications of robust optimization
- Robust optimization
- The Price of Robustness
- Robust Optimization of Large-Scale Systems
- Global formulation for interactive multiobjective optimization
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Constructing uncertainty sets for robust linear optimization
- On Efficient Solutions to Multiple Objective Mathematical Programs
- Survey of multi-objective optimization methods for engineering
- Robust optimization-methodology and applications
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Robust solutions to multi-objective linear programs with uncertain data
- Optimization over the efficient set
- Optimization over the efficient set: overview
- Minmax robustness for multi-objective optimization problems
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- An interactive weighted Tchebycheff procedure for multiple objective programming
- An exact method for computing the nadir values in multiple objective linear programming
- A review of interactive methods for multiobjective integer and mixed-integer programming
- Some inequalities relating to the partial sum of binomial probabilities
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Maximizing a concave function over the efficient or weakly-efficient set
- A post-optimality analysis algorithm for multi-objective optimization
- Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming
- An algorithm for optimizing a linear function over an integer efficient set
- Finding preferred subsets of Pareto optimal solutions
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
- Robustness analysis in multi-objective mathematical programming using Monte Carlo simulation
- Interactive Coordination of Objective Decompositions in Multiobjective Programming
- On finding representative non-dominated points for bi-objective integer network flow problems
- Representation of the non-dominated set in biobjective discrete optimization
- 2D decision-making for multicriteria design optimization
- Title not available (Why is that?)
- Optimizing Over the Efficient Set Using a Top-Down Search of Faces
Cited In (11)
- Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint
- Computation of robust Pareto points
- Robustness analysis in multi-objective mathematical programming using Monte Carlo simulation
- Algorithm robust for the bicriteria discrete optimization problem
- Pareto optimality and robustness in bi-blending problems
- Bi-objective robust optimisation
- Choquet optimal set in biobjective combinatorial optimization
- Pareto efficiency in robust optimization
- Approximating the Pareto set of multiobjective linear programs via robust optimization
- Operations research for sustainability assessment of products: a review
- A post-optimality analysis algorithm for multi-objective optimization
Uses Software
This page was built for publication: Biobjective robust optimization over the efficient set for Pareto set reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322934)