Tight second-stage formulations in two-stage stochastic mixed integer programs
Manish Bansal (bansalvt.edu)
Abstract: We study two-stage stochastic mixed integer programs (TSS-MIPs) with integer variables in the second stage. We show that under suitable conditions, the second stage MIPs can be convexified by adding parametric cuts a priori. As special cases, we extend the results of Miller and Wolsey (Math Program 98(1):73-88, 2003) to TSS-MIPs. Furthermore, we consider second stage programs that are generalizations of the well-known mixing (and continuous mixing) set, or certain piecewise-linear convex objective integer programs. These results allow us to relax the integrality restrictions on the second stage integer variables without effecting the integrality of the optimal solution of the TSS-MIP. We also use four variants of the two-stage stochastic capacitated lot-sizing problems as test problems for computational experiments, and present tight second-stage formulations for these problems. Our computational results show that adding parametric inequalities that a priori convexify the second stage formulation significantly reduces the total solution time taken to solve these problems.
Keywords: two-stage stochastic mixed integer program, tight formulations, capacitated lot-sizing with backlogging, discrete lot-sizing, continuous mixing, cutting planes, convex hull
Category 1: Stochastic Programming
Category 2: Integer Programming (Cutting Plane Approaches )
Category 3: Applications -- OR and Management Sciences (Production and Logistics )
Citation: M. Bansal, K. L. Huang, S. Mehrotra, Tight second-stage formulations for two-stage stochastic mixed integer programming problems," SIAM Journal on Optimization, 28(1), 788-819, 2018.
Entry Submitted: 09/23/2015
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|