Chance Constrained Mixed Integer Program: Bilinear and Linear Formulations, and Benders Decomposition

In this paper, we study chance constrained mixed integer program with consideration of recourse decisions and their incurred cost, developed on a nite discrete scenario set. Through studying a non-traditional bilinear mixed integer formulation, we derive its linear counterparts and show that they could be stronger than existing linear formulations. We also develop a variant of Jensen’s inequality that extends the one for stochastic program. To solve this challenging problem, we present a variant of Benders decomposition method in bilinear form, which actually provides an easy-to-use algorithm framework for further improvements, along with a few enhancement strategies based on structural properties or Jensen’s inequality. Computational study shows that the presented Benders decomposition method, jointly with appropriate enhancement techniques, outperforms a commercial solver by an order of magnitude on solving chance constrained program or detecting its infeasibility.

[1]  A. Charnes,et al.  Cost Horizons and Certainty Equivalents: An Approach to Stochastic Programming of Heating Oil , 1958 .

[2]  J. Birge,et al.  A multicut algorithm for two-stage stochastic linear programs , 1988 .

[3]  Thomas L. Magnanti,et al.  Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria , 1981, Oper. Res..

[4]  James R. Luedtke,et al.  Chance-Constrained Binary Packing Problems , 2014, INFORMS J. Comput..

[5]  On the relationship between probabilistic constrained , disjunctive and multiobjective programming , 2006 .

[6]  Andrzej Ruszczynski,et al.  An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems , 2007, Oper. Res..

[7]  Jonathan Cole Smith,et al.  Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths , 2010, Manag. Sci..

[8]  George L. Nemhauser,et al.  An integer programming approach for linear programs with probabilistic constraints , 2007, Math. Program..

[9]  Barbara J. Lence,et al.  Surface water quality management using a multiple‐realization chance constraint method , 1999 .

[10]  John R. Birge,et al.  Introduction to Stochastic Programming , 1997 .

[11]  Lewis Ntaimo,et al.  IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation , 2010, Eur. J. Oper. Res..

[12]  John R. Birge,et al.  Introduction to Stochastic programming (2nd edition), Springer verlag, New York , 2011 .

[13]  Brian T. Denton,et al.  Operating Room Pooling and Parallel Surgery Processing Under Uncertainty , 2011, INFORMS J. Comput..

[14]  James R. Luedtke,et al.  A Sample Approximation Approach for Optimization with Probabilistic Constraints , 2008, SIAM J. Optim..

[15]  B. Norman,et al.  A solution to the stochastic unit commitment problem using chance constrained programming , 2004, IEEE Transactions on Power Systems.

[16]  Andrzej Ruszczynski,et al.  Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra , 2002, Math. Program..

[17]  R. Jagannathan,et al.  Chance-Constrained Programming with Joint Constraints , 1974, Oper. Res..

[18]  J. Jensen.  Sur les fonctions convexes et les inégalités entre les valeurs moyennes , 1906 .

[19]  Giuseppe Carlo Calafiore,et al.  Uncertain convex programs: randomized solutions and confidence levels , 2005, Math. Program..

[20]  Matthew W. Tanner,et al.  Finding optimal vaccination strategies under parameter uncertainty using stochastic programming. , 2008, Mathematical biosciences.

[21]  András Prékopa,et al.  Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution , 1990, ZOR Methods Model. Oper. Res..

[22]  Nilay Noyan,et al.  Alternate risk measures for emergency medical service system design , 2010, Ann. Oper. Res..

[23]  Oktay Günlük,et al.  Mixing mixed-integer inequalities , 2001, Math. Program..

[24]  Itay Gurvich,et al.  Staffing Call Centers with Uncertain Demand Forecasts: A Chance-Constrained Optimization Approach , 2010, Manag. Sci..

[25]  Antonio Alonso Ayuso,et al.  Introduction to Stochastic Programming , 2009 .

[26]  Sergey Sarykalin,et al.  Value-at-Risk vs. Conditional Value-at-Risk in Risk Management and Optimization , 2008 .

[27]  Garth P. McCormick,et al.  Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..

[28]  Nikolaos Papadakos,et al.  Practical enhancements to the Magnanti-Wong method , 2008, Oper. Res. Lett..

[29]  A. Madansky.  Inequalities for Stochastic Linear Programming Problems , 1960 .

[30]  Martin W. P. Savelsbergh,et al.  The mixed vertex packing problem , 2000, Math. Program..

[31]  Lewis Ntaimo,et al.  Adaptive multicut aggregation for two-stage stochastic linear programs with recourse , 2010, Eur. J. Oper. Res..

[32]  James R. Luedtke.  A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support , 2013, Mathematical Programming.

[33]  Brian T. Denton,et al.  Dynamic Appointment Scheduling of a Stochastic Server with Uncertain Demand , 2013, INFORMS J. Comput..

[34]  Simge Küçükyavuz,et al.  On mixing sets arising in chance-constrained programming , 2012, Math. Program..

[35]  Nilay Noyan,et al.  Mathematical programming approaches for generating p-efficient points , 2010, Eur. J. Oper. Res..

[36]  Zhihao Chen,et al.  Optimization models for differentiating quality of service levels in probabilistic network capacity design problems , 2013 .

[37]  Anthony Wren.  Proceedings of the Princeton Symposium on Mathematical Programming , 1972 .

[38]  Patrizia Beraldi,et al.  A branch and bound method for stochastic integer problems under probabilistic constraints , 2002, Optim. Methods Softw..

[39]  Alexander Shapiro,et al.  Lectures on Stochastic Programming: Modeling and Theory , 2009 .

[40]  Marianthi G. Ierapetritou,et al.  Improving benders decomposition using maximum feasible subsystem (MFS) cut generation strategy , 2010, Comput. Chem. Eng..

[41]  András Prékopa,et al.  ON PROBABILISTIC CONSTRAINED PROGRAMMING , 2015 .

[42]  Darinka Dentcheva,et al.  Concavity and efficient points of discrete distributions in probabilistic programming , 2000, Math. Program..