Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Deterministisk linjär programmering – Klassisk LP med säkra parametrar× | Stokastisk linjär programmering× | |
|---|---|---|
| Ämnesområde | Simulering | Simulering |
| Familj | Process / pipeline | Process / pipeline |
| Ursprungsår≠ | 1947 | 1955 |
| Upphovsperson | George B. Dantzig | George B. Dantzig |
| Typ≠ | Deterministic mathematical optimization | Stochastic optimization model |
| Ursprungskälla≠ | Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press, Princeton, NJ. ISBN: 9780691059136 | Dantzig, G. B., & Madansky, A. (1961). On the solution of two-stage linear programs under uncertainty. Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, 1, 165–176. link ↗ |
| Alias | Classical LP, Deterministic LP, DLP, Linear Optimization | SLP, Stochastic LP, Linear Programming under Uncertainty, Two-Stage SLP |
| Närliggande | 5 | 5 |
| Sammanfattning≠ | 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. | Stochastic Linear Programming (SLP) extends classical linear programming to settings where some model parameters — costs, demands, resource availability — are uncertain and modeled as random variables. By optimizing expected costs over a probability distribution of scenarios, SLP produces decisions that remain feasible and near-optimal across a range of possible futures rather than for a single assumed state of the world. |
| ScholarGateDatamängd ↗ |
|
|