方法对比
并排查看您选择的方法;存在差异的行会高亮显示。
| 鲁棒多目标优化× | 鲁棒优化× | |
|---|---|---|
| 领域≠ | 仿真 | 优化 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 2006 | 1970s theoretical roots; modern tractable form from late 1990s–2004 |
| 提出者≠ | Deb, K. & Gupta, H. | Ben-Tal, El Ghaoui & Nemirovski (seminal book, 2009); Bertsimas & Sim (tractable polyhedral formulation, 2004) |
| 类型≠ | Optimization framework | Mathematical programming framework |
| 开创性文献≠ | Deb, K., & Gupta, H. (2006). Introducing robustness in multi-objective optimization. Evolutionary Computation, 14(4), 463–494. DOI ↗ | Ben-Tal, A., El Ghaoui, L. & Nemirovski, A. (2009). Robust Optimization. Princeton University Press. ISBN: 9780691143682 |
| 别名≠ | RMOO, Robust MOO, Robust Pareto Optimization, Uncertainty-Robust Multi-Objective Optimization | minimax optimization, worst-case optimization, Gürbüz Optimizasyon (Robust Optimization) |
| 相关≠ | 4 | 5 |
| 摘要≠ | 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. | Robust optimization is a mathematical programming framework, formalised by Ben-Tal and Nemirovski in the late 1990s and made broadly tractable by Bertsimas and Sim (2004), that finds decisions guaranteed to perform acceptably under every scenario within a predefined uncertainty set — rather than assuming parameter values are known exactly. Instead of optimising for a single expected outcome, it minimises the worst-case objective across all plausible realisations of uncertain data. |
| ScholarGate数据集 ↗ |
|
|