方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 鲁棒整数规划× | 随机整数规划× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 2003 | 1955 |
| 提出者≠ | Bertsimas, D. and Sim, M. | Dantzig, G. B.; Beale, E. M. L. |
| 类型≠ | Deterministic robust optimization with integer variables | Optimization under uncertainty with discrete decisions |
| 开创性文献≠ | Bertsimas, D., Sim, M. (2003). Robust discrete optimization and network flows. Mathematical Programming, 98(1-3), 49-71. DOI ↗ | Birge, J. R., & Louveaux, F. (1997). Introduction to Stochastic Programming. Springer, New York. ISBN: 978-1-4614-0237-4 |
| 别名 | RIP, Robust IP, Robust Combinatorial Optimization, Integer Robust Optimization | SIP, Stochastic IP, Integer Stochastic Programming, Mixed-Integer Stochastic Programming |
| 相关 | 6 | 6 |
| 摘要≠ | Robust Integer Programming (RIP) finds integer or binary solutions that remain feasible and near-optimal across all scenarios in a prescribed uncertainty set. Rather than assuming exact knowledge of data, RIP hedges against the worst-case realization of uncertain costs or constraint coefficients, delivering decisions that are guaranteed to perform well even when inputs deviate from their nominal values. | Stochastic Integer Programming (SIP) is an optimization framework that combines integer (discrete) decision variables with explicit probabilistic modeling of uncertainty. It seeks the best here-and-now decision that minimizes expected cost (or maximizes expected benefit) across a distribution of future scenarios, accounting for the fact that some decisions must be made before uncertainty is resolved. |
| ScholarGate数据集 ↗ |
|
|