Metodbevispost

Robust Optimization

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.

Sources recorded, not reviewed

Källpost

Citat kopierade ordagrant från metodens källpost. Ingen verifiering på källnivå härleds från dem.

Robust Optimization (Minimax Programming)

Taxonomisk metodpost · process-pipeline / optimization

Ben-Tal, A., El Ghaoui, L. & Nemirovski, A. (2009). Robust Optimization. Princeton University Press. · ISBN 9780691143682
Bertsimas, D. & Sim, M. (2004). The Price of Robustness. Operations Research, 52(1), 35-53. · DOI 10.1287/opre.1030.0065

Öppna fullständig metod

Kuraterade påståenden

Påståenden lagrade i bevisloggen, var och en med sin egen bedömning.

Inga kuraterade påståenden ännu

Denna vy hittar inte på en påståendebedömning när loggen saknar en.

Relaterade metoder

Genererade från metodgrafen och visade som maskinföreslagna relationer – inga bevispåståenden härleds.

Same method familyConvex Optimizationmachine-suggested · Relational suggestion, not evidence.Same method familyEvolutionary Strategymachine-suggested · Relational suggestion, not evidence.Same method familyLinear Programmingmachine-suggested · Relational suggestion, not evidence.Same method familyStochastic Optimizationmachine-suggested · Relational suggestion, not evidence.Same method familySurrogate-Based Optimizationmachine-suggested · Relational suggestion, not evidence.