Serviceeinschränkungen vom 12.-22.02.2026 - weitere Infos auf der UB-Homepage

Treffer: Technical Note—Multistage Robust Mixed-Integer Programming.

Title:
Technical Note—Multistage Robust Mixed-Integer Programming.
Source:
Operations Research; Nov/Dec2025, Vol. 73 Issue 6, p3345-3358, 14p
Database:
Complementary Index

Weitere Informationen

In the paper "Multistage Robust Mixed-Integer Programming," Krzysztof Postek, Ward Romeijnders, and Wolfram Wiesemann study multistage robust mixed-integer programming problems, a popular and powerful yet computationally demanding framework for decision making under uncertainty. The authors leverage dynamic programming principles to decompose multistage problems into large numbers of two-stage subproblems, and they use the finite adaptability approach to solve the latter to exact or approximate optimality. The resulting method allows for efficient parallelization, and the authors showcase its effectiveness on route planning and location-transportation problems. Multistage robust optimization, in which decisions are taken sequentially as new information becomes available about uncertain problem parameters, is a very versatile yet computationally challenging paradigm for decision making under uncertainty. In this technical note, we propose a new model and solution approach for multistage robust mixed-integer programs, which may contain both continuous and discrete decisions at any time stage. Our model builds upon the finite adaptability scheme developed for two-stage robust optimization problems, and it allows us to decompose the multistage problem into a large number of much simpler two-stage problems. We discuss how these two-stage problems can be solved both exactly and approximately, and we report numerical results for route planning and location-transportation problems. [ABSTRACT FROM AUTHOR]

Copyright of Operations Research is the property of INFORMS: Institute for Operations Research & the Management Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Volltext ist im Gastzugang nicht verfügbar.