방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 확률적 목표 계획법× | 강건 목표 계획× | |
|---|---|---|
| 분야 | 시뮬레이션 | 시뮬레이션 |
| 계열 | 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데이터셋 ↗ |
|
|