Process / pipelineSimulation / optimization

Stochastic Mixed-Integer Programming — Optimization Under Uncertainty with Discrete and Continuous Decisions

Stochastic Mixed-Integer Programming (SMIP) is an optimization framework that finds the best mix of binary, integer, and continuous decisions when key parameters — costs, demands, capacities — are uncertain and modeled as probability distributions over a set of scenarios. It extends classical MIP by embedding scenario trees or expected-value objectives that hedge against uncertainty while respecting combinatorial constraints.

MethodMind'de açSoonVideoSoon

Tam yöntemi oku

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Birge, J. R., & Louveaux, F. (1997). Introduction to Stochastic Programming. Springer Series in Operations Research. New York: Springer. ISBN: 9780387982175
  2. Sen, S., & Higle, J. L. (2005). The C3 theorem and a D2 algorithm for large scale stochastic mixed-integer programming: Set convexification. Mathematical Programming, 104(1), 1–20. DOI: 10.1007/s10107-004-0566-z

Related methods

Referenced by

ScholarGateStochastic Mixed-Integer Programming (Stochastic Mixed-Integer Programming (SMIP)). Retrieved 2026-06-04 from https://scholargate.app/tr/simulation/stochastic-mixed-integer-programming