Confronta i metodi
Esamina i metodi selezionati fianco a fianco; le righe che differiscono sono evidenziate.
| Programmazione Lineare Robusta× | Programmazione Robusta a Variabili Miste Intere× | |
|---|---|---|
| Campo | Simulazione | Simulazione |
| Famiglia | Process / pipeline | Process / pipeline |
| Anno di origine≠ | 1999–2004 | 1998–2004 |
| Ideatore≠ | Ben-Tal, A. and Nemirovski, A.; further developed by Bertsimas, D. and Sim, M. | Ben-Tal & Nemirovski; Bertsimas & Sim |
| Tipo≠ | Uncertainty-robust linear optimization | Deterministic robust reformulation of MIP under uncertainty |
| Fonte seminale | Bertsimas, D., Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35–53. DOI ↗ | Bertsimas, D., Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35–53. DOI ↗ |
| Alias | RLP, Robust LP, Tractable Robust LP, Uncertainty-Set LP | RMIP, Robust MIP, Uncertain MIP, Robust MILP/MIQP |
| Correlati≠ | 5 | 4 |
| Sintesi≠ | 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 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. |
| ScholarGateInsieme di dati ↗ |
|
|