ScholarGate
Msaidizi
Process / pipeline

Uboreshaji Imara — Upangaji wa Hisabati wa Kesi Mbaya Zaidi

Uboreshaji imara ni mfumo wa upangaji wa hisabati, uliofanyizwa na Ben-Tal na Nemirovski mwishoni mwa miaka ya 1990 na kufanywa kuwa rahisi kutatuliwa na Bertsimas na Sim (2004), unaopata maamuzi yaliyohakikishiwa kufanya ipasavyo katika kila hali ndani ya seti ya kutokuwa na uhakika iliyofafanuliwa awali — badala ya kudhani maadili ya kigezo yanajulikana hasa. Badala ya kuboresha kwa matokeo moja yanayotarajiwa, hupunguza lengo la hali mbaya zaidi katika utekelezaji wote unaowezekana wa data isiyo na uhakika.

Fungua katika MethodMindHivi karibuniVideoHivi karibuniDownload slides

Soma mbinu kamili

Kwa wanachama pekee

Ingia kwa akaunti ya bure ili kusoma sehemu hii.

Ingia

Method map

The neighbourhood of related methods — select a node to explore.

Vyanzo

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

Jinsi ya kunukuu ukurasa huu

ScholarGate. (2026, June 1). Robust Optimization (Minimax Programming). ScholarGate. https://scholargate.app/sw/optimization/robust-optimization

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side

Imerejelewa na

ScholarGateRobust Optimization (Robust Optimization (Minimax Programming)). Imepatikana 2026-06-15 kutoka https://scholargate.app/sw/optimization/robust-optimization · Seti ya data: https://doi.org/10.5281/zenodo.20539026