방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 강건 선형 계획법× | 확률적 선형 계획법× | |
|---|---|---|
| 분야 | 시뮬레이션 | 시뮬레이션 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1999–2004 | 1955 |
| 창시자≠ | Ben-Tal, A. and Nemirovski, A.; further developed by Bertsimas, D. and Sim, M. | George B. Dantzig |
| 유형≠ | Uncertainty-robust linear optimization | Stochastic optimization model |
| 원전≠ | Bertsimas, D., Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35–53. DOI ↗ | Dantzig, G. B., & Madansky, A. (1961). On the solution of two-stage linear programs under uncertainty. Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, 1, 165–176. link ↗ |
| 별칭 | RLP, Robust LP, Tractable Robust LP, Uncertainty-Set LP | SLP, Stochastic LP, Linear Programming under Uncertainty, Two-Stage SLP |
| 관련 | 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. | Stochastic Linear Programming (SLP) extends classical linear programming to settings where some model parameters — costs, demands, resource availability — are uncertain and modeled as random variables. By optimizing expected costs over a probability distribution of scenarios, SLP produces decisions that remain feasible and near-optimal across a range of possible futures rather than for a single assumed state of the world. |
| ScholarGate데이터셋 ↗ |
|
|