Zapis dokaza metode

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

Izvorni zapis

Citati kopirani doslovno iz izvornog zapisa metode. Ne impliciraju nikakvu provjeru na razini tvrdnje.

Robust Optimization (Minimax Programming)

Taksonomski zapis metode · 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

Otvori cijelu metodu

Uređene tvrdnje

Tvrdnje pohranjene u knjigu dokaza, svaka s vlastitom procjenom.

Nema uređenih tvrdnji

Ovaj prikaz ne izmišlja procjenu tvrdnje kada knjiga dokaza nema nijednu.

Povezane metode

Generirano iz grafa metode i prikazano kao strojno predložene relacije — ne implicira se nikakva tvrdnja dokaza.

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.