可解释性
随机优化
计算机科学
还原(数学)
数学优化
最优化问题
领域(数学)
数学
算法
人工智能
几何学
纯数学
作者
Dimitris Bertsimas,Nishanth Mundru
出处
期刊:Operations Research
[Institute for Operations Research and the Management Sciences]
日期:2023-07-01
卷期号:71 (4): 1343-1361
被引量:24
标识
DOI:10.1287/opre.2022.2265
摘要
In the field of data-driven optimization under uncertainty, scenario reduction is a commonly used technique for computing a smaller number of scenarios to improve computational tractability and interpretability. However traditional approaches do not consider the decision quality when computing these scenarios. In “Optimization-Based Scenario Reduction for Data-Driven Two-Stage Stochastic Optimization,” Bertsimas and Mundru present a novel optimization-based method that explicitly considers the objective and problem structure for reducing the number of scenarios needed for solving two-stage stochastic optimization problems. This new proposed method is generally applicable and has significantly better performance when the number of reduced scenarios is 1%–2% of the full sample size compared with other state-of-the-art optimization and randomization methods, which suggests this improves both tractability and interpretability.
科研通智能强力驱动
Strongly Powered by AbleSci AI