方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 随机整数规划× | 随机动态规划× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1955 | 1957 |
| 提出者≠ | Dantzig, G. B.; Beale, E. M. L. | Bellman, R.; formalized for stochastic settings by Puterman, M. L. |
| 类型≠ | Optimization under uncertainty with discrete decisions | Sequential optimization under uncertainty |
| 开创性文献≠ | Birge, J. R., & Louveaux, F. (1997). Introduction to Stochastic Programming. Springer, New York. ISBN: 978-1-4614-0237-4 | Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780486428093 |
| 别名 | SIP, Stochastic IP, Integer Stochastic Programming, Mixed-Integer Stochastic Programming | SDP, Markov Decision Process, MDP, Stochastic DP |
| 相关 | 6 | 6 |
| 摘要≠ | 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. | Stochastic Dynamic Programming (SDP) is a mathematical optimization framework for sequential decision problems where outcomes are partly random. It extends Bellman's principle of optimality to stochastic environments, representing problems as Markov Decision Processes (MDPs) and computing optimal policies by solving recursive value equations over states and time periods. |
| ScholarGate数据集 ↗ |
|
|