Sammenlign metoder
Gjennomgå de valgte metodene side om side; rader som avviker, er uthevet.
| Deterministisk Dynamisk Programmering× | Deterministisk Lineær Programmering – Klassisk LP med sikre parametere× | |
|---|---|---|
| Fagfelt | Simulering | Simulering |
| Familie | Process / pipeline | Process / pipeline |
| Opprinnelsesår≠ | 1957 | 1947 |
| Opphavsperson≠ | Richard E. Bellman | George B. Dantzig |
| Type≠ | Exact sequential optimization algorithm | Deterministic mathematical optimization |
| Opprinnelig kilde≠ | Bellman, R. E. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780691079516 | Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press, Princeton, NJ. ISBN: 9780691059136 |
| Alias | DDP, Deterministic DP, Classical Dynamic Programming, Bellman Dynamic Programming | Classical LP, Deterministic LP, DLP, Linear Optimization |
| Relaterte≠ | 6 | 5 |
| Sammendrag≠ | 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 Linear Programming (DLP) is the classical form of linear programming in which all objective function coefficients, constraint coefficients, and right-hand-side values are known with certainty. It finds the optimal allocation of resources to maximize or minimize a linear objective subject to linear constraints, providing an exact, reproducible solution under fixed, certain data. |
| ScholarGateDatasett ↗ |
|
|