Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Robust linjärprogrammering× | Deterministisk linjär programmering – Klassisk LP med säkra parametrar× | |
|---|---|---|
| Ämnesområde | Simulering | Simulering |
| Familj | Process / pipeline | Process / pipeline |
| Ursprungsår≠ | 1999–2004 | 1947 |
| Upphovsperson≠ | Ben-Tal, A. and Nemirovski, A.; further developed by Bertsimas, D. and Sim, M. | George B. Dantzig |
| Typ≠ | Uncertainty-robust linear optimization | Deterministic mathematical optimization |
| Ursprungskälla≠ | Bertsimas, D., Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35–53. DOI ↗ | Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press, Princeton, NJ. ISBN: 9780691059136 |
| Alias | RLP, Robust LP, Tractable Robust LP, Uncertainty-Set LP | Classical LP, Deterministic LP, DLP, Linear Optimization |
| Närliggande | 5 | 5 |
| Sammanfattning≠ | Robust Linear Programming (RLP) extends classical linear programming to handle uncertainty in problem data — cost coefficients, constraint coefficients, or right-hand sides — by requiring solutions to remain feasible and near-optimal across all realizations of uncertain parameters within a defined uncertainty set. It replaces probabilistic assumptions with worst-case guarantees, making it practical when distributional knowledge is limited. | 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. |
| ScholarGateDatamängd ↗ |
|
|