Mathematical Programming

, Volume 137, Issue 1, pp 167–198

Distributionally robust joint chance constraints with second-order moment information

Full Length Paper Series A

DOI: 10.1007/s10107-011-0494-7

Cite this article as:
Zymler, S., Kuhn, D. & Rustem, B. Math. Program. (2013) 137: 167. doi:10.1007/s10107-011-0494-7


We develop tractable semidefinite programming based approximations for distributionally robust individual and joint chance constraints, assuming that only the first- and second-order moments as well as the support of the uncertain parameters are given. It is known that robust chance constraints can be conservatively approximated by Worst-Case Conditional Value-at-Risk (CVaR) constraints. We first prove that this approximation is exact for robust individual chance constraints with concave or (not necessarily concave) quadratic constraint functions, and we demonstrate that the Worst-Case CVaR can be computed efficiently for these classes of constraint functions. Next, we study the Worst-Case CVaR approximation for joint chance constraints. This approximation affords intuitive dual interpretations and is provably tighter than two popular benchmark approximations. The tightness depends on a set of scaling parameters, which can be tuned via a sequential convex optimization algorithm. We show that the approximation becomes essentially exact when the scaling parameters are chosen optimally and that the Worst-Case CVaR can be evaluated efficiently if the scaling parameters are kept constant. We evaluate our joint chance constraint approximation in the context of a dynamic water reservoir control problem and numerically demonstrate its superiority over the two benchmark approximations.

Mathematics Subject Classification (2010)

90C15 90C22 

Copyright information

© Springer and Mathematical Optimization Society 2011

Authors and Affiliations

  1. 1.Department of ComputingImperial College LondonLondonUK