An algorithm for binary linear chance-constrained problems using IIS

We propose an algorithm based on infeasible irreducible subsystems to solve binary linear chance-constrained problems with random technology matrix. By leveraging on the problem structure we are able to generate good quality upper bounds to the optimal value early in the algorithm, and the discrete domain is used to guide us efficiently in the search of solutions. We apply our methodology to individual and joint binary linear chance-constrained problems, demonstrating the ability of our approach to solve those problems. Extensive numerical experiments show that, in some cases, the number of nodes explored by our algorithm is drastically reduced when compared to a commercial solver.

[1]  Miguel A. Lejeune,et al.  MIP reformulations of the probabilistic set covering problem , 2010, Math. Program..

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

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

[4]  M. Campi,et al.  The scenario approach for systems and control design , 2008 .

[5]  Dimitri J. Papageorgiou,et al.  Probabilistic Set Covering with Correlations , 2013, Oper. Res..

[6]  M. Kumral.  Application of chance-constrained programming based on multi-objective simulated annealing to solve a mineral blending problem , 2003 .

[7]  Alexander Shapiro,et al.  Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications , 2009, J. Optimization Theory and Applications.

[8]  Miguel A. Lejeune,et al.  Pattern-Based Modeling and Solution of Probabilistically Constrained Optimization Problems , 2012, Oper. Res..

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

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

[11]  John W. Chinneck,et al.  Feasibility and Infeasibility in Optimization:: Algorithms and Computational Methods , 2007 .

[12]  Patrizia Beraldi,et al.  The Probabilistic Set-Covering Problem , 2002, Oper. Res..

[13]  Jennifer Ryan,et al.  Identifying Minimally Infeasible Subsystems of Inequalities , 1990, INFORMS J. Comput..

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

[15]  J. Beasley.  An algorithm for set covering problem , 1987 .

[16]  Fouad Ben Abdelaziz,et al.  Multi-objective stochastic programming for portfolio selection , 2007, Eur. J. Oper. Res..

[17]  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..

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

[19]  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..

[20]  Subhash C. Sarin,et al.  Chance Constrained Programming Models for Risk-Based Economic and Policy Analysis of Soil Conservation , 1994, Agricultural and Resource Economics Review.

[21]  Ricardo Fukasawa,et al.  On the mixing set with a knapsack constraint , 2016, Math. Program..

[22]  Marco C. Campi,et al.  The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs , 2008, SIAM J. Optim..