Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Байєсівське лінійне програмування× | Багатоцільове лінійне програмування (БЛП)× | |
|---|---|---|
| Галузь | Імітаційне моделювання | Імітаційне моделювання |
| Родина | Process / pipeline | Process / pipeline |
| Рік появи≠ | 1970s–1980s | 1955–1986 |
| Автор методу≠ | Integrated from Dantzig (LP) and Zellner/Bayesian econometrics traditions | Steuer, R. E.; Charnes, A.; Cooper, W. W. |
| Тип≠ | Optimization under Bayesian uncertainty | Mathematical optimization / vector optimization |
| Основоположне джерело≠ | Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press, Princeton, NJ. ISBN: 9780691059136 | Steuer, R. E. (1986). Multiple Criteria Optimization: Theory, Computation, and Application. John Wiley & Sons, New York. ISBN: 9780471888468 |
| Інші назви | BLP, Bayesian LP, Bayesian stochastic linear programming, prior-posterior LP | MOLP, Vector Linear Programming, Multi-criteria LP, Linear Vector Optimization |
| Пов'язані≠ | 6 | 3 |
| Підсумок≠ | 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. | Multi-Objective Linear Programming (MOLP) extends classical linear programming to handle several conflicting linear objective functions simultaneously over a feasible region defined by linear constraints. Instead of a single optimal solution, MOLP produces a Pareto-efficient frontier from which a decision-maker selects a preferred trade-off. It is foundational to operations research and management science for resource allocation, planning, and design problems with competing goals. |
| ScholarGateНабір даних ↗ |
|
|