.png){kind=icon}
Return
Multistage robust discrete optimization via quantified integer programming
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2021.105434.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Decision making needs to take an uncertain environment into account. Over the last decades, robust optimization has emerged as a preeminent method to produce solutions that are immunized against uncertainty. The main focus in robust discrete optimization has been on the analysis and solution of one-or two-stage problems, where the decision maker has limited options in reacting to additional knowledge gained after parts of the solution have been fixed. Due to its computational difficulty, multistage problems beyond two stages have received less attention. In this paper we argue that multistage robust discrete problems can be seen through the lens of quantified integer programs, where powerful tools to reduce the search tree size have been developed. By formulating both integer and quantified integer programming formulations, it is possible to compare the performance of state-of-the-art solvers from both worlds. Using selection, assignment, lot-sizing and knapsack problems as a testbed, we show that problems with up to nine stages can be solved to optimality in reasonable time.
Keywords:
Robust optimization
Multistage optimization
Quantified integer programming
Discrete optimization
Optimization under uncertainty
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers
ShareSave
ShareSaveShareSaveShareSaveShareSaveBody weight loss, effective satiation and absence of homeostatic neuropeptide compensation in male Sprague Dawley rats schedule fed a protein crosslinked diet.png)
AppetiteOAAI
AppetiteIF0
OAAIShareSave
View more