Võrdle meetodeid

	Kahetasemeline optimeerimine (juht-järgija)	Robustne optimeerimine
Valdkond	Optimeerimine	Optimeerimine
Perekond	Process / pipeline	Process / pipeline
Tekkeaasta	1998	1970s theoretical roots; modern tractable form from late 1990s–2004
Looja	Jonathan Bard	Ben-Tal, El Ghaoui & Nemirovski (seminal book, 2009); Bertsimas & Sim (tractable polyhedral formulation, 2004)
Tüüp	Hierarchical mathematical programming	Mathematical programming framework
Algallikas	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
Rööpnimetused	Stackelberg Optimization, Hierarchical Programming, Nested Optimization, İki Düzeyli Optimizasyon	minimax optimization, worst-case optimization, Gürbüz Optimizasyon (Robust Optimization)
Seotud	3	5
Kokkuvõte	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.