Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Programare Liniară cu Numere Întregi Deterministă× | Programare Liniară Deterministică× | |
|---|---|---|
| Domeniu | Simulare | Simulare |
| Familie | Process / pipeline | Process / pipeline |
| Anul apariției≠ | 1958–1960 | 1947 |
| Autorul original≠ | Gomory, R. E.; Dantzig, G. B.; Land, A. H.; Doig, A. G. | George B. Dantzig |
| Tip≠ | Mathematical programming / combinatorial optimization | Deterministic mathematical optimization |
| Sursa seminală≠ | Nemhauser, G. L., Wolsey, L. A. (1988). Integer and Combinatorial Optimization. John Wiley & Sons, New York. ISBN: 9780471359432 | Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press, Princeton, NJ. ISBN: 9780691059136 |
| Denumiri alternative | Deterministic MIP, Deterministic MILP/MIQP, Classical Mixed-Integer Programming, Deterministic MIP Optimization | Classical LP, Deterministic LP, DLP, Linear Optimization |
| Înrudite≠ | 6 | 5 |
| Rezumat≠ | Deterministic Mixed-Integer Programming (MIP) is a mathematical optimization framework that finds the provably optimal solution to problems involving both continuous and integer decision variables under fully known, fixed coefficients and constraints. It is the foundational workhorse of operations research when all data are treated as certain. | 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. |
| ScholarGateSet de date ↗ |
|
|