Abstract
In this paper, we consider optimization problems under probabilistic constraints which are defined by two-sided inequalities for the underlying normally distributed random vector. As a main step for an algorithmic solution of such problems, we prove a derivative formula for (normal) probabilities of rectangles as functions of their lower or upper bounds. This formula allows to reduce the calculus of such derivatives to the calculus of (normal) probabilities of rectangles themselves thus generalizing a similar well-known statement for multivariate normal distribution functions. As an application, we consider a problem from water reservoir management. One of the outcomes of the problem solution is that the (still frequently encountered) use of simple individual probabilistic constraints can completely fail. By contrast, the (more difficult) use of joint probabilistic constraints, which heavily depends on the derivative formula mentioned before, yields very reasonable and robust solutions over the whole time horizon considered.
Similar content being viewed by others
References
Andrieu L, Henrion R, Römisch W (2009) A model for dynamic chance constraints in hydro power reservoir management, Preprint 536, DFG Research Center MATHEON “Mathematics for key technologies”
Deák I (1980) Three digit accurate multiple normal probabilities. Numerische Mathematik 35: 369–380
Genz A (1992) Numerical computation of multivariate normal probabilities. J Comp Graph Stat 1: 141–149
Genz A, Bretz F (2009) Computation of multivariate normal and t probabilities. Lecture Notes in Statistics, vol. 195. Springer, Dordrecht
Genz A (1992) http://www.math.wsu.edu/faculty/genz/homepage
Henrion R, Römisch W (2005) Lipschitz and differentiability properties of quasi-concave and singular normal distribution functions, to appear in: Ann Oper Res, appeared electronically under doi:10.1007/s10479-009-0598-0
Prékopa A (1973) On logarithmic concave measures and functions. Acta Scientiarium Mathematicarum (Szeged) 34: 335–343
Prékopa A (1995) Stochastic programming. Kluwer, Dordrecht
Prékopa A (2003) Probabilistic programming, Chap 5. In: Ruszczyński A, Shapiro A (eds) Stochastic programming. Handbooks in Operations Research and Management Science, vol 10. Elsevier, Amsterdam
Szántai T (2000) Improved bounds and simulation procedures on the value of the multivariate normal probability distribution function. Ann Oper Res 100: 85–101
Uryasev S (1995) Derivatives of probability functions and some applications. Ann Oper Res 56: 287–311
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by the OSIRIS Department of Electricité de France R&D and by the DFG Research Center Matheon “Mathematics for key technologies” in Berlin.
Rights and permissions
About this article
Cite this article
Van Ackooij, W., Henrion, R., Möller, A. et al. On probabilistic constraints induced by rectangular sets and multivariate normal distributions. Math Meth Oper Res 71, 535–549 (2010). https://doi.org/10.1007/s00186-010-0316-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-010-0316-3
Keywords
- Stochastic programming
- Probabilistic constraints
- Chance constraints
- Derivative of probabilities of rectangles
- Water reservoir management