Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Programowanie liniowe bayesowskie× | Solidne programowanie liniowe× | |
|---|---|---|
| Dziedzina | Symulacja | Symulacja |
| Rodzina | Process / pipeline | Process / pipeline |
| Rok powstania≠ | 1970s–1980s | 1999–2004 |
| Twórca≠ | Integrated from Dantzig (LP) and Zellner/Bayesian econometrics traditions | Ben-Tal, A. and Nemirovski, A.; further developed by Bertsimas, D. and Sim, M. |
| Typ≠ | Optimization under Bayesian uncertainty | Uncertainty-robust linear optimization |
| Źródło pierwotne≠ | Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press, Princeton, NJ. ISBN: 9780691059136 | Bertsimas, D., Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35–53. DOI ↗ |
| Inne nazwy | BLP, Bayesian LP, Bayesian stochastic linear programming, prior-posterior LP | RLP, Robust LP, Tractable Robust LP, Uncertainty-Set LP |
| Pokrewne≠ | 6 | 5 |
| Podsumowanie≠ | Bayesian Linear Programming (BLP) integrates Bayesian statistical inference with classical linear programming to handle uncertainty in model parameters such as objective function coefficients, constraint coefficients, or right-hand-side values. Instead of treating parameters as fixed or governed by worst-case bounds, BLP uses prior beliefs updated by data to form posterior distributions, which then guide the LP formulation and solution, producing decisions that are optimal in a probabilistic, data-informed sense. | 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. |
| ScholarGateZbiór danych ↗ |
|
|