Biobjective robust optimization over the efficient set for Pareto set reduction

DOI10.1016/j.ejor.2016.01.017zbMath1346.90736OpenAlexW2260221217MaRDI QIDQ322934

V. Jorge Leon, Daniel Jornada

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

zbMATH Keywords

multiple criteria analysismultiple objective programmingrobustness and sensitivity analysisPareto set reduction

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Minimax problems in mathematical programming (90C47) Multi-objective and goal programming (90C29)

Related Items (2)

Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint ⋮ Operations research for sustainability assessment of products: a review

Uses Software

• NBI

Cites Work

• Unnamed Item
• Unnamed Item
• Minmax robustness for multi-objective optimization problems
• On finding representative non-dominated points for bi-objective integer network flow problems
• Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
• Representation of the non-dominated set in biobjective discrete optimization
• 2D decision-making for multicriteria design optimization
• Survey of multi-objective optimization methods for engineering
• Optimization over the efficient set: overview
• Global formulation for interactive multiobjective optimization
• Some inequalities relating to the partial sum of binomial probabilities
• A review of interactive methods for multiobjective integer and mixed-integer programming
• An exact method for computing the nadir values in multiple objective linear programming
• Theory of multiobjective optimization
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Nonlinear multiobjective optimization
• Robust discrete optimization and its applications
• Computation of ideal and Nadir values and implications for their use in MCDM methods.
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• Robust discrete optimization and network flows
• Maximizing a concave function over the efficient or weakly-efficient set
• Robust optimization-methodology and applications
• 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
• Robust solutions to multi-objective linear programs with uncertain data
• Constructing Uncertainty Sets for Robust Linear Optimization
• Theory and Applications of Robust Optimization
• Interactive Coordination of Objective Decompositions in Multiobjective Programming
• On Efficient Solutions to Multiple Objective Mathematical Programs
• The Price of Robustness
• Optimizing Over the Efficient Set Using a Top-Down Search of Faces
• An interactive weighted Tchebycheff procedure for multiple objective programming
• Robust Optimization of Large-Scale Systems
• Probability Inequalities for Sums of Bounded Random Variables
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Optimization over the efficient set

This page was built for publication: Biobjective robust optimization over the efficient set for Pareto set reduction