方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 鲁棒线性规划× | 鲁棒混合整数规划× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1999–2004 | 1998–2004 |
| 提出者≠ | Ben-Tal, A. and Nemirovski, A.; further developed by Bertsimas, D. and Sim, M. | Ben-Tal & Nemirovski; Bertsimas & Sim |
| 类型≠ | Uncertainty-robust linear optimization | Deterministic robust reformulation of MIP under uncertainty |
| 开创性文献 | 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 ↗ |
| 别名 | RLP, Robust LP, Tractable Robust LP, Uncertainty-Set LP | RMIP, Robust MIP, Uncertain MIP, Robust MILP/MIQP |
| 相关≠ | 5 | 4 |
| 摘要≠ | 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. |
| ScholarGate数据集 ↗ |
|
|