Journal
MATHEMATICAL PROGRAMMING
Volume 89, Issue 1, Pages 55-77Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/PL00011393
Keywords
probabilistic programming; discrete distributions; generalized concavity; column generation
Ask authors/readers for more resources
We consider stochastic programming problems with probabilistic constraints involving integer-valued random variables. The concept of a p-efficient point of a probability distribution is used to derive various equivalent problem formulations. Next we introduce the concept of r-concave discrete probability distributions and analyse its relevance for problems under consideration. These notions are used to derive lower and upper bounds for the optimal Value of probabilistically constrained stochastic programming problems with discrete random variables. The results are illustrated with numerical examples.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available