Decision space robustness for multi-objective integer linear programming
type: Item
instance of: scholarly article
title: Decision space robustness for multi-objective integer linear programming
author: Michael Stiglmayr
author: Kathrin Klamroth
author: Luís Paquete
author: Britta Schulze
author: José Rui Figueira
published in: Annals of Operations Research
publication date: 2022-12-20T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C17
zbMATH DE Number: 7634706
zbMATH Keywords: multi-objective integer programming
zbMATH Keywords: decision space robustness
zbMATH Keywords: connectedness of efficient solutions
zbMATH Keywords: representation
zbMATH Keywords: decision analysis
MaRDI profile type: Publication
full work available at URL: s10479-021-04462-w
OpenAlex ID: W4200427289
cites work: Bulk-robust combinatorial optimization
cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey
cites work: Electre Tri-C: A multiple criteria sorting method based on characteristic reference actions
cites work: Q3182207
cites work: Robust optimization - a comprehensive survey
cites work: Introduction to Stochastic Programming
cites work: Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems
cites work: Computation of robust Pareto points
cites work: Multicriteria Optimization
cites work: Minmax robustness for multi-objective optimization problems
cites work: Connectedness of efficient solutions in multiple criteria combinatorial optimization
cites work: Decision uncertainty in multiobjective optimization
cites work: An algorithmic approach to multiobjective optimization with decision uncertainty
cites work: Connectedness of efficient solutions in multiple objective combinatorial optimization
cites work: Flexible here-and-now decisions for two-stage multi-objective optimization: method and application to energy system design selection
cites work: Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
cites work: Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
cites work: The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
cites work: Robust recoverable and two-stage selection problems
cites work: Robust discrete optimization and its applications
cites work: Multiple objective linear programming models with interval coefficients -- an illustrated overview
cites work: Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
cites work: Q3997893
cites work: Q3815146
cites work: Representation of the non-dominated set in biobjective discrete optimization
cites work: A variational approach to define robustness for parametric multiobjective optimization problems
DOI: 10.1007/S10479-021-04462-W
Recommended article: Robust aspects of solutions in deterministic multiple objective linear programming
Recommended article: Robustness in deterministic multi-objective linear programming with respect to the relative interior and angle deviation
Recommended article: Robust solutions to multi-objective linear programs with uncertain data
Recommended article: On highly robust efficient solutions to uncertain multiobjective linear programs
Recommended article: Robustness in nonsmooth nonlinear multi-objective programming
Recommended article: A concept of a robust solution of a multicriterial linear programming problem
Recommended article: Robust optimization model for uncertain multiobjective linear programs
Recommended article: Q4667010
Recommended article: On robust multiobjective optimization
Recommended article: Optimality and duality for robust multiobjective optimization problems
description: scientific article; zbMATH DE number 7634706