Meetodi tõendite kirje

Robust Integer Programming

Robust Integer Programming (RIP) finds integer or binary solutions that remain feasible and near-optimal across all scenarios in a prescribed uncertainty set. Rather than assuming exact knowledge of data, RIP hedges against the worst-case realization of uncertain costs or constraint coefficients, delivering decisions that are guaranteed to perform well even when inputs deviate from their nominal values.

Sources recorded, not reviewed

Allikakirje

Tsiteeringud kopeeritud meetodi allikakirjest sõna-sõnalt. Nendest ei saa järeldada väidete tasemel kinnitust.

Robust Integer Programming — Optimization under uncertainty with integrality constraints

Taksonoomiline meetodikirje · process-pipeline / simulation

Bertsimas, D., Sim, M. (2003). Robust discrete optimization and network flows. Mathematical Programming, 98(1-3), 49-71. · DOI 10.1007/s10107-003-0396-4
Ben-Tal, A., El Ghaoui, L., Nemirovski, A. (2009). Robust Optimization. Princeton University Press, Princeton, NJ. · ISBN 9780691143682

Ava täielik meetod

Kureeritud väited

Väited on salvestatud tõendite registrisse, igal oma hinnanguga.

Kureeritud väiteid veel pole

See vaade ei loo väite hinnangut, kui registris seda pole.

Seotud meetodid

Genereeritud meetodigraafist ja kuvatud masina soovitatud seostena – väiteid ei järeldata.

Same method familyInteger Programmingmachine-suggested · Relational suggestion, not evidence.Taxonomic bucketMixed-Integer Programmingmachine-suggested · Relational suggestion, not evidence.Taxonomic bucketRobust Linear Programmingmachine-suggested · Relational suggestion, not evidence.Taxonomic bucketRobust Mixed-Integer Programmingmachine-suggested · Relational suggestion, not evidence.Taxonomic bucketRobust Multi-Objective Optimizationmachine-suggested · Relational suggestion, not evidence.Taxonomic bucketStochastic Integer Programmingmachine-suggested · Relational suggestion, not evidence.