方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 双层优化（领导者-跟随者）× | 鲁棒优化× | |
|---|---|---|
| 领域 | 优化 | 优化 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1998 | 1970s theoretical roots; modern tractable form from late 1990s–2004 |
| 提出者≠ | Jonathan Bard | Ben-Tal, El Ghaoui & Nemirovski (seminal book, 2009); Bertsimas & Sim (tractable polyhedral formulation, 2004) |
| 类型≠ | Hierarchical mathematical programming | Mathematical programming framework |
| 开创性文献≠ | Bard, J. F. (1998). Practical Bilevel Optimization: Algorithms and Applications. Kluwer Academic Publishers. ISBN: 978-0-7923-5458-7 | Ben-Tal, A., El Ghaoui, L. & Nemirovski, A. (2009). Robust Optimization. Princeton University Press. ISBN: 9780691143682 |
| 别名≠ | Stackelberg Optimization, Hierarchical Programming, Nested Optimization, İki Düzeyli Optimizasyon | minimax optimization, worst-case optimization, Gürbüz Optimizasyon (Robust Optimization) |
| 相关≠ | 3 | 5 |
| 摘要≠ | Bilevel optimization is a class of mathematical programming problems in which one optimization problem is nested inside another. The upper-level (leader) problem optimizes its objective subject to constraints that include the solution of a lower-level (follower) problem. Formalized comprehensively by Jonathan Bard in 1998, the framework models hierarchical decision-making where the leader anticipates and accounts for the rational response of the follower. | 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数据集 ↗ |
|
|