Variable-sized uncertainty and inverse problems in robust optimization |
| |
Authors: | André Chassein Marc Goerigk |
| |
Institution: | 1. Fachbereich Mathematik, Technische Universität Kaiserslautern, 67653 Kaiserslautern, Germany;2. Department of Management Science, Lancaster University, Lancaster LA1 4YX, United Kingdom |
| |
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: | Robustness and sensitivity analysis Uncertainty sets Inverse optimization Optimization under uncertainty |
本文献已被 ScienceDirect 等数据库收录! |
|