Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs

Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult to solve. This paper presents a first computational study of a disjunctive cutting plane method for stochastic mixed 0-1 programs that uses lift-and-project cuts based on the extensive form of the two-stage SMIP problem. An extension of the method based on where the data uncertainty appears in the problem is made, and it is shown how a valid inequality derived for one scenario can be made valid for other scenarios, potentially reducing solution time. Computational results amply demonstrate the effectiveness of disjunctive cuts in solving several large-scale problem instances from the literature. The results are compared to the computational results of disjunctive cuts based on the subproblem space of the formulation and it is shown that the two methods are equivalently effective on the test instances.

[1]  Julia L. Higle,et al.  The C 3 theorem and a D 2 algorithm for large scale stochastic integer programming , 2000 .

[2]  Lewis Ntaimo,et al.  The Million-Variable “March” for Stochastic Combinatorial Optimization , 2005, J. Glob. Optim..

[3]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[4]  Egon Balas.  Disjunctive Programming , 2010, 50 Years of Integer Programming.

[5]  B. WETSt,et al.  STOCHASTIC PROGRAMS WITH FIXED RECOURSE : THE EQUIVALENT DETERMINISTIC PROGRAM , 2022 .

[6]  Hanif D. Sherali,et al.  Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization , 1987, Math. Program..

[7]  Hanif D. Sherali,et al.  Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming , 2006, Math. Program..

[8]  Hanif D. Sherali,et al.  Optimization with disjunctive constraints , 1980 .

[9]  Gilbert Laporte,et al.  The integer L-shaped method for stochastic integer programs with complete recourse , 1993, Oper. Res. Lett..

[10]  Lewis Ntaimo,et al.  A comparative study of decomposition algorithms for stochastic combinatorial optimization , 2008, Comput. Optim. Appl..

[11]  Gloria Pérez,et al.  An Approach for Strategic Supply Chain Planning under Uncertainty based on Stochastic 0-1 Programming , 2003, J. Glob. Optim..

[12]  Julia L. Higle,et al.  The C3 Theorem and a D2 Algorithm for Large Scale Stochastic Mixed-Integer Programming: Set Convexification , 2005, Math. Program..

[13]  R. Wets,et al.  L-SHAPED LINEAR PROGRAMS WITH APPLICATIONS TO OPTIMAL CONTROL AND STOCHASTIC PROGRAMMING. , 1969 .

[14]  Rüdiger Schultz,et al.  Dual decomposition in stochastic integer programming , 1999, Oper. Res. Lett..

[15]  Gilbert Laporte,et al.  An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands , 2002, Oper. Res..

[16]  Claus C. Carøe,et al.  A cutting-plane approach to mixed 0-1 stochastic integer programs , 1997 .

[17]  E. Balas.  Disjunctive programming and a hierarchy of relaxations for discrete optimization problems , 1985 .

[18]  Shabbir Ahmed,et al.  Dynamic Capacity Acquisition and Assignment under Uncertainty , 2003, Ann. Oper. Res..

[19]  R. Wets.  Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program , 1974 .

[20]  E. Balas,et al.  Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .

[21]  E. Balas.  DISJUNCTIVE PROGRAMMING: CUTTING PLANES FROM LOGICAL CONDITIONS , 1975 .

[22]  Lewis Ntaimo,et al.  Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse , 2010, Oper. Res..

[23]  Charles E. Blair,et al.  A converse for disjunctive constraints , 1978 .