方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 鲁棒整数规划× | 鲁棒多目标优化× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 2003 | 2006 |
| 提出者≠ | Bertsimas, D. and Sim, M. | Deb, K. & Gupta, H. |
| 类型≠ | Deterministic robust optimization with integer variables | Optimization framework |
| 开创性文献≠ | Bertsimas, D., Sim, M. (2003). Robust discrete optimization and network flows. Mathematical Programming, 98(1-3), 49-71. DOI ↗ | Deb, K., & Gupta, H. (2006). Introducing robustness in multi-objective optimization. Evolutionary Computation, 14(4), 463–494. DOI ↗ |
| 别名 | RIP, Robust IP, Robust Combinatorial Optimization, Integer Robust Optimization | RMOO, Robust MOO, Robust Pareto Optimization, Uncertainty-Robust Multi-Objective Optimization |
| 相关≠ | 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 Multi-Objective Optimization (RMOO) is a framework for finding solutions that simultaneously optimize multiple conflicting objectives while remaining insensitive to perturbations in decision variables or problem parameters. Unlike classical MOO, RMOO explicitly incorporates uncertainty into the optimization loop, producing a robust Pareto front whose members perform well not only at the nominal design point but also across a neighbourhood of plausible operating conditions. |
| ScholarGate数据集 ↗ |
|
|