방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 강건 선형 계획법× | 강건 목표 계획× | |
|---|---|---|
| 분야 | 시뮬레이션 | 시뮬레이션 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1999–2004 | 1961 (GP); 1990s (robust extension) |
| 창시자≠ | Ben-Tal, A. and Nemirovski, A.; further developed by Bertsimas, D. and Sim, M. | Charnes, A. & Cooper, W. W. (goal programming); Mulvey, J. M. et al. (robust optimization framework) |
| 유형≠ | Uncertainty-robust linear optimization | Mathematical programming under uncertainty |
| 원전≠ | Bertsimas, D., Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35–53. DOI ↗ | Charnes, A., Cooper, W. W. (1961). Management Models and Industrial Applications of Linear Programming. Wiley, New York. ISBN: 9780471155041 |
| 별칭 | RLP, Robust LP, Tractable Robust LP, Uncertainty-Set LP | RGP, Goal Programming under Uncertainty, Robust GP, Uncertainty-Aware Goal Programming |
| 관련 | 5 | 5 |
| 요약≠ | 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. | 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데이터셋 ↗ |
|
|