Sammenlign metoder

	Robust Mixed-Integer Programming	Robust Lineær Programmering
Fagområde	Simulering	Simulering
Familie	Process / pipeline	Process / pipeline
Oprindelsesår	1998–2004	1999–2004
Ophavsperson	Ben-Tal & Nemirovski; Bertsimas & Sim	Ben-Tal, A. and Nemirovski, A.; further developed by Bertsimas, D. and Sim, M.
Type	Deterministic robust reformulation of MIP under uncertainty	Uncertainty-robust linear optimization
Oprindelig kilde	Bertsimas, D., Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35–53.	Bertsimas, D., Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35–53.
Aliasser	RMIP, Robust MIP, Uncertain MIP, Robust MILP/MIQP	RLP, Robust LP, Tractable Robust LP, Uncertainty-Set LP
Relaterede	4	5
Resumé	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.	Robust Linear Programming (RLP) extends classical linear programming to handle uncertainty in problem data — cost coefficients, constraint coefficients, or right-hand sides — by requiring solutions to remain feasible and near-optimal across all realizations of uncertain parameters within a defined uncertainty set. It replaces probabilistic assumptions with worst-case guarantees, making it practical when distributional knowledge is limited.