Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Стохастичне цільове програмування× | Программування цілей з робастністю× | |
|---|---|---|
| Галузь | Імітаційне моделювання | Імітаційне моделювання |
| Родина | Process / pipeline | Process / pipeline |
| Рік появи≠ | 1968 | 1961 (GP); 1990s (robust extension) |
| Автор методу≠ | Contini, B. (building on Charnes & Cooper's chance-constrained programming) | Charnes, A. & Cooper, W. W. (goal programming); Mulvey, J. M. et al. (robust optimization framework) |
| Тип≠ | Stochastic multi-goal optimization | Mathematical programming under uncertainty |
| Основоположне джерело≠ | Contini, B. (1968). A stochastic approach to goal programming. Operations Research, 16(3), 576–586. DOI ↗ | Charnes, A., Cooper, W. W. (1961). Management Models and Industrial Applications of Linear Programming. Wiley, New York. ISBN: 9780471155041 |
| Інші назви | SGP, Stochastic GP, Chance-Constrained Goal Programming, Probabilistic Goal Programming | RGP, Goal Programming under Uncertainty, Robust GP, Uncertainty-Aware Goal Programming |
| Пов'язані≠ | 6 | 5 |
| Підсумок≠ | Stochastic Goal Programming (SGP) extends classical goal programming to handle uncertainty in goal targets, constraint coefficients, or right-hand-side parameters. By incorporating probabilistic constraints and stochastic objective components, it finds solutions that satisfy multiple goals at acceptable probability levels, making it suitable for decision problems where data are inherently uncertain or variable. | Robust Goal Programming (RGP) extends classical goal programming to handle uncertain or ambiguous model parameters. Instead of minimizing deviations from crisp targets, it seeks solutions that remain feasible and near-optimal across a range of plausible scenarios or uncertain data realizations. RGP is particularly valuable in planning problems where goals are aspirational and input data carries inherent variability or estimation error. |
| ScholarGateНабір даних ↗ |
|
|