Salīdzināt metodes

	Robustā veselo skaitļu programmēšana	Robust Mixed-Integer Programming
Nozare	Simulācija	Simulācija
Saime	Process / pipeline	Process / pipeline
Izcelsmes gads	2003	1998–2004
Autors	Bertsimas, D. and Sim, M.	Ben-Tal & Nemirovski; Bertsimas & Sim
Tips	Deterministic robust optimization with integer variables	Deterministic robust reformulation of MIP under uncertainty
Pirmavots	Bertsimas, D., Sim, M. (2003). Robust discrete optimization and network flows. Mathematical Programming, 98(1-3), 49-71.	Bertsimas, D., Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35–53.
Citi nosaukumi	RIP, Robust IP, Robust Combinatorial Optimization, Integer Robust Optimization	RMIP, Robust MIP, Uncertain MIP, Robust MILP/MIQP
Saistītās	6	4
Kopsavilkums	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.	Robust Mixed-Integer Programming (RMIP) combines mixed-integer programming with robust optimization to find solutions that remain feasible and near-optimal despite uncertain parameters. Instead of assuming fixed data, it protects decisions against adversarial or worst-case realizations of uncertain inputs, using an explicit uncertainty set to control the degree of conservatism while preserving the combinatorial structure of integer decisions.