We investigate, as a special case of robust optimization, integer linear programs with variables being either existentially or universally quantified. They can be interpreted as two-person zero-sum games between an existential and a universal player. In this setting the existential player must ensure the fulfillment of a system of linear constraints, while the universal variables can range within given intervals, trying to make the fulfillment impossible. We extend this approach by adding a linear constraint system the universal player must obey. Consequently, existential and universal variable assignments in early decision stages now can restrain possible universal variable assignments later on and vice versa resulting in a multistage optimization problem with decision dependent uncertainty. We present novel insights in structure and complexity.
CITATION STYLE
Hartisch, M., & Lorenz, U. (2019). Mastering uncertainty: Towards robust multistage optimization with decision dependent uncertainty. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11670 LNAI, pp. 446–458). Springer Verlag. https://doi.org/10.1007/978-3-030-29908-8_36
Mendeley helps you to discover research relevant for your work.