Improved Integer Programming Approaches for Chance-Constrained Stochastic Programming

The Chance-Constrained Stochastic Programming (CCSP) is one of the models for decision making under uncertainty. In this paper, we consider the special case of the CCSP in which only the right-hand side vector is random with a discrete distribution having a finite support. The unit commitment problem is one of the applications of the special case of the CCSP. Existing methods for exactly solving the CCSP problems require an enumeration of scenarios when they model a CCSP problem using a Mixed Integer Programming (MIP). We show how to reduce the number of scenarios enumerated in the MIP model. In addition, we give another compact MIP formulation to approximately solve the CCSP problems.

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

[2]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

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

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

[5]  James R. Luedtke.  An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs , 2010, IPCO.

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

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

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

[9]  András Prékopa,et al.  Contributions to the theory of stochastic programming , 1973, Math. Program..

[10]  Nicholas I. M. Gould,et al.  SIAM Journal on Optimization , 2012 .

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

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

[13]  Hector Geffner,et al.  Planning under Partial Observability by Classical Replanning: Theory and Experiments , 2011, IJCAI.

[14]  Michael J. Todd,et al.  Mathematical programming , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[15]  Daniel P. Heyman,et al.  Stochastic models in operations research , 1982 .

[16]  Toshimde Ibaraki.  Integer programming formulation of combinatorial optimization problems , 1976, Discret. Math..

[17]  G. Winskel.  What Is Discrete Mathematics , 2007 .

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

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

[20]  PRINCETON UNIVERSITY PRESS , 2005 .

[21]  L. Goddard,et al.  Operations Research (OR) , 2007 .

[22]  L. Comtet,et al.  Advanced Combinatorics: The Art of Finite and Infinite Expansions , 1974 .

[23]  Marco C. Campi,et al.  A Sampling-and-Discarding Approach to Chance-Constrained Optimization: Feasibility and Optimality , 2011, J. Optim. Theory Appl..

[24]  George L. Nemhauser,et al.  Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions , 2010, Oper. Res..