Abstract.
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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: October 1998 / Accepted: June 2000¶Published online October 18, 2000
Rights and permissions
About this article
Cite this article
Dentcheva, D., Prékopa, A. & Ruszczynski, A. Concavity and efficient points of discrete distributions in probabilistic programming. Math. Program. 89, 55–77 (2000). https://doi.org/10.1007/PL00011393
Issue Date:
DOI: https://doi.org/10.1007/PL00011393