Process / pipelineSimulation / optimization

Robust Mixed-Integer Programming — Optimization with integer variables under uncertainty

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.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

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

Related methods

Referenced by

ScholarGateRobust Mixed-Integer Programming (Robust Mixed-Integer Programming (RMIP) — Optimization under uncertainty with integer decision variables). Retrieved 2026-06-04 from https://scholargate.app/en/simulation/robust-mixed-integer-programming