Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- 454 Downloads
We consider stochastic programming problems with probabilistic constraints involving random variables with discrete distributions. They can be reformulated as large scale mixed integer programming problems with knapsack constraints. Using specific properties of stochastic programming problems and bounds on the probability of the union of events we develop new valid inequalities for these mixed integer programming problems. We also develop methods for lifting these inequalities. These procedures are used in a general iterative algorithm for solving probabilistically constrained problems. The results are illustrated with a numerical example.
KeywordsProgramming Problem Specific Property Integer Programming Iterative Algorithm Mixed Integer
Unable to display preview. Download preview PDF.