方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 确定性动态规划× | 确定性整数规划× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1957 | 1958 |
| 提出者≠ | Richard E. Bellman | Ralph E. Gomory |
| 类型≠ | Exact sequential optimization algorithm | Exact combinatorial optimization |
| 开创性文献≠ | Bellman, R. E. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780691079516 | Gomory, R. E. (1958). Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society, 64(5), 275-278. DOI ↗ |
| 别名 | DDP, Deterministic DP, Classical Dynamic Programming, Bellman Dynamic Programming | DIP, Integer Programming, IP, Integer Linear Programming |
| 相关≠ | 6 | 5 |
| 摘要≠ | Deterministic Dynamic Programming (DDP) is a mathematical optimization technique that decomposes a multi-stage decision problem into a sequence of simpler subproblems, solving them exactly when all system parameters — transition functions, costs, and rewards — are known with certainty. It guarantees a globally optimal policy via Bellman's principle of optimality. | Deterministic Integer Programming (DIP) is a mathematical optimization approach that finds the best solution to problems where some or all decision variables must take integer values, given fully known (deterministic) objective and constraint data. It is the classical, non-stochastic form of integer programming, foundational to operations research and combinatorial optimization since the late 1950s. |
| ScholarGate数据集 ↗ |
|
|