Porovnat metody
Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.
| Robustní celočíselné programování× | Robustní celočíselné programování se smíšenými proměnnými× | |
|---|---|---|
| Obor | Simulace | Simulace |
| Rodina | Process / pipeline | Process / pipeline |
| Rok vzniku≠ | 2003 | 1998–2004 |
| Tvůrce≠ | Bertsimas, D. and Sim, M. | Ben-Tal & Nemirovski; Bertsimas & Sim |
| Typ≠ | Deterministic robust optimization with integer variables | Deterministic robust reformulation of MIP under uncertainty |
| Původní zdroj≠ | 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 ↗ |
| Další názvy | RIP, Robust IP, Robust Combinatorial Optimization, Integer Robust Optimization | RMIP, Robust MIP, Uncertain MIP, Robust MILP/MIQP |
| Příbuzné≠ | 6 | 4 |
| Shrnutí≠ | 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. |
| ScholarGateDatová sada ↗ |
|
|