Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Programare Liniară Deterministică× | Programare Dinamică Deterministică× | |
|---|---|---|
| Domeniu | Simulare | Simulare |
| Familie | Process / pipeline | Process / pipeline |
| Anul apariției≠ | 1947 | 1957 |
| Autorul original≠ | George B. Dantzig | Richard E. Bellman |
| Tip≠ | Deterministic mathematical optimization | Exact sequential optimization algorithm |
| Sursa seminală≠ | Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press, Princeton, NJ. ISBN: 9780691059136 | Bellman, R. E. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780691079516 |
| Denumiri alternative | Classical LP, Deterministic LP, DLP, Linear Optimization | DDP, Deterministic DP, Classical Dynamic Programming, Bellman Dynamic Programming |
| Înrudite≠ | 5 | 6 |
| Rezumat≠ | 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. | 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. |
| ScholarGateSet de date ↗ |
|
|