방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 강건 정수 계획법× | 강건 혼합 정수 계획법× | |
|---|---|---|
| 분야 | 시뮬레이션 | 시뮬레이션 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 2003 | 1998–2004 |
| 창시자≠ | Bertsimas, D. and Sim, M. | Ben-Tal & Nemirovski; Bertsimas & Sim |
| 유형≠ | Deterministic robust optimization with integer variables | Deterministic robust reformulation of MIP under uncertainty |
| 원전≠ | Bertsimas, D., Sim, M. (2003). Robust discrete optimization and network flows. Mathematical Programming, 98(1-3), 49-71. DOI ↗ | Bertsimas, D., Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35–53. DOI ↗ |
| 별칭 | RIP, Robust IP, Robust Combinatorial Optimization, Integer Robust Optimization | RMIP, Robust MIP, Uncertain MIP, Robust MILP/MIQP |
| 관련≠ | 6 | 4 |
| 요약≠ | Robust Integer Programming (RIP) finds integer or binary solutions that remain feasible and near-optimal across all scenarios in a prescribed uncertainty set. Rather than assuming exact knowledge of data, RIP hedges against the worst-case realization of uncertain costs or constraint coefficients, delivering decisions that are guaranteed to perform well even when inputs deviate from their nominal values. | Robust Mixed-Integer Programming (RMIP) combines mixed-integer programming with robust optimization to find solutions that remain feasible and near-optimal despite uncertain parameters. Instead of assuming fixed data, it protects decisions against adversarial or worst-case realizations of uncertain inputs, using an explicit uncertainty set to control the degree of conservatism while preserving the combinatorial structure of integer decisions. |
| ScholarGate데이터셋 ↗ |
|
|