Home > Research > Publications & Outputs > Variable-Sized Uncertainty and Inverse Problems...

Links

View graph of relations

Variable-Sized Uncertainty and Inverse Problems in Robust Optimization

Research output: Working paper

Published

Standard

Harvard

APA

Vancouver

Author

Bibtex

@techreport{1991daf9b398450ab1e102a1aa952601,
title = "Variable-Sized Uncertainty and Inverse Problems in Robust Optimization",
abstract = "In robust optimization, the general aim is to find a solution that performs well over a set of possible parameter outcomes, the so-called uncertainty set. In this paper, we assume that the uncertainty size is not fixed, and instead aim at finding a set of robust solutions that covers all possible uncertainty set outcomes. We refer to these problems as robust optimization with variable-sized uncertainty. We discuss how to construct smallest possible sets of min-max robust solutions and give bounds on their size. A special case of this perspective is to analyze for which uncertainty sets a nominal solution ceases to be a robust solution, which amounts to an inverse robust optimization problem. We consider this problem with a min-max regret objective and present mixed-integer linear programming formulations that can be applied to construct suitable uncertainty sets. Results on both variable-sized uncertainty and inverse problems are further supported with experimental data.",
keywords = "robust optimization, uncertainty sets, inverse optimization, optimization under uncertainty",
author = "Andr{\'e} Chassein and Marc Goerigk",
year = "2016",
month = jun,
day = "23",
language = "English",
type = "WorkingPaper",

}

RIS

TY - UNPB

T1 - Variable-Sized Uncertainty and Inverse Problems in Robust Optimization

AU - Chassein, André

AU - Goerigk, Marc

PY - 2016/6/23

Y1 - 2016/6/23

N2 - In robust optimization, the general aim is to find a solution that performs well over a set of possible parameter outcomes, the so-called uncertainty set. In this paper, we assume that the uncertainty size is not fixed, and instead aim at finding a set of robust solutions that covers all possible uncertainty set outcomes. We refer to these problems as robust optimization with variable-sized uncertainty. We discuss how to construct smallest possible sets of min-max robust solutions and give bounds on their size. A special case of this perspective is to analyze for which uncertainty sets a nominal solution ceases to be a robust solution, which amounts to an inverse robust optimization problem. We consider this problem with a min-max regret objective and present mixed-integer linear programming formulations that can be applied to construct suitable uncertainty sets. Results on both variable-sized uncertainty and inverse problems are further supported with experimental data.

AB - In robust optimization, the general aim is to find a solution that performs well over a set of possible parameter outcomes, the so-called uncertainty set. In this paper, we assume that the uncertainty size is not fixed, and instead aim at finding a set of robust solutions that covers all possible uncertainty set outcomes. We refer to these problems as robust optimization with variable-sized uncertainty. We discuss how to construct smallest possible sets of min-max robust solutions and give bounds on their size. A special case of this perspective is to analyze for which uncertainty sets a nominal solution ceases to be a robust solution, which amounts to an inverse robust optimization problem. We consider this problem with a min-max regret objective and present mixed-integer linear programming formulations that can be applied to construct suitable uncertainty sets. Results on both variable-sized uncertainty and inverse problems are further supported with experimental data.

KW - robust optimization

KW - uncertainty sets

KW - inverse optimization

KW - optimization under uncertainty

M3 - Working paper

BT - Variable-Sized Uncertainty and Inverse Problems in Robust Optimization

ER -