.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Robust optimization
Multistage optimization
Quantified integer programming
Discrete optimization
Optimization under uncertainty
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
分享收藏A multi-stage stochastic integer programming approach for a multi-echelon lot-sizing problem with returns and lost sales具有退货和销售损失的多级批量问题的多阶段随机整数规划方法OAAI
OAAI分享收藏分享收藏分享收藏Body weight loss, effective satiation and absence of homeostatic neuropeptide compensation in male Sprague Dawley rats schedule fed a protein crosslinked diet.png)
AppetiteOAAI
AppetiteIF0
OAAI分享收藏
查看更多内容