Concavity and Efficient Points of Discrete Distributions in Probabilistic Programming

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 Probabilistic constraints are one of the main challenges of modern stochastic program ming Their motivation is clear if in the linear program min