Biobjective robust optimization over the efficient set for Pareto set reduction
type: Item
instance of: scholarly article
title: Biobjective robust optimization over the efficient set for Pareto set reduction
zbMATH Open document ID: 1346.90736
author: Daniel Jornada
author: V. Jorge Leon
published in: European Journal of Operational Research
publication date: 2016-10-07T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C47
zbMATH DE Number: 6636242
zbMATH Keywords: multiple criteria analysis
zbMATH Keywords: multiple objective programming
zbMATH Keywords: robustness and sensitivity analysis
zbMATH Keywords: Pareto set reduction
describes a project that uses: NBI
MaRDI profile type: MaRDI publication profile
full work available at URL: j.ejor.2016.01.017
OpenAlex ID: W2260221217
cites work: A review of interactive methods for multiobjective integer and mixed-integer programming
cites work: An exact method for computing the nadir values in multiple objective linear programming
cites work: Q3182207
cites work: Robust optimization-methodology and applications
cites work: Optimization over the efficient set
cites work: Constructing Uncertainty Sets for Robust Linear Optimization
cites work: Theory and Applications of Robust Optimization
cites work: Robust discrete optimization and network flows
cites work: The Price of Robustness
cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
cites work: Multiple criteria optimization: State of the art annotated bibliographic surveys
cites work: Minmax robustness for multi-objective optimization problems
cites work: Computation of ideal and Nadir values and implications for their use in MCDM methods.
cites work: 2D decision-making for multicriteria design optimization
cites work: Interactive Coordination of Objective Decompositions in Multiobjective Programming
cites work: On finding representative non-dominated points for bi-objective integer network flow problems
cites work: Q4296848
cites work: Robust solutions to multi-objective linear programs with uncertain data
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Maximizing a concave function over the efficient or weakly-efficient set
cites work: An algorithm for optimizing a linear function over an integer efficient set
cites work: Finding preferred subsets of Pareto optimal solutions
cites work: Robust discrete optimization and its applications
cites work: On Efficient Solutions to Multiple Objective Mathematical Programs
cites work: Global formulation for interactive multiobjective optimization
cites work: Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming
cites work: Survey of multi-objective optimization methods for engineering
cites work: Robustness analysis in multi-objective mathematical programming using Monte Carlo simulation
cites work: Nonlinear multiobjective optimization
cites work: Robust Optimization of Large-Scale Systems
cites work: Some inequalities relating to the partial sum of binomial probabilities
cites work: Theory of multiobjective optimization
cites work: An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
cites work: Optimizing Over the Efficient Set Using a Top-Down Search of Faces
cites work: An interactive weighted Tchebycheff procedure for multiple objective programming
cites work: Representation of the non-dominated set in biobjective discrete optimization
cites work: A post-optimality analysis algorithm for multi-objective optimization
cites work: Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
cites work: Optimization over the efficient set: overview
cites work: The set of all nondominated solutions in linear cases and a multicriteria simplex method
DOI: 10.1016/J.EJOR.2016.01.017
description: scientific article; zbMATH DE number 6636242