Optimized Bonferroni approximations of distributionally robust joint chance constraints

A distributionally robust joint chance constraint involves a set of uncertain linear inequalities which can be violated up to a given probability threshold $$\epsilon $$ , over a given family of probability distributions of the uncertain parameters. A conservative approximation of a joint chance constraint, often referred to as a Bonferroni approximation, uses the union bound to approximate the joint chance constraint by a system of single chance constraints, one for each original uncertain constraint, for a fixed choice of violation probabilities of the single chance constraints such that their sum does not exceed $$\epsilon $$ . It has been shown that, under various settings, a distributionally robust single chance constraint admits a deterministic convex reformulation. Thus the Bonferroni approximation approach can be used to build convex approximations of distributionally robust joint chance constraints. In this paper we consider an optimized version of Bonferroni approximation where the violation probabilities of the individual single chance constraints are design variables rather than fixed a priori. We show that such an optimized Bonferroni approximation of a distributionally robust joint chance constraint is exact when the uncertainties are separable across the individual inequalities, i.e., each uncertain constraint involves a different set of uncertain parameters and corresponding distribution families. Unfortunately, the optimized Bonferroni approximation leads to NP-hard optimization problems even in settings where the usual Bonferroni approximation is tractable. When the distribution family is specified by moments or by marginal distributions, we derive various sufficient conditions under which the optimized Bonferroni approximation is convex and tractable. We also show that for moment based distribution families and binary decision variables, the optimized Bonferroni approximation can be reformulated as a mixed integer second-order conic set. Finally, we demonstrate how our results can be used to derive a convex reformulation of a distributionally robust joint chance constraint with a specific non-separable distribution family.

[1]  Abdel Lisser,et al.  Distributionally Robust Stochastic Knapsack Problem , 2014, SIAM J. Optim..

[2]  Giuseppe Carlo Calafiore,et al.  The scenario approach to robust control design , 2006, IEEE Transactions on Automatic Control.

[3]  Ruiwei Jiang,et al.  Data-driven chance constrained stochastic program , 2015, Mathematical Programming.

[4]  Shabbir Ahmed,et al.  On Deterministic Reformulations of Distributionally Robust Joint Chance Constrained Optimization Problems , 2018, SIAM J. Optim..

[5]  James R. Luedtke,et al.  A Sample Approximation Approach for Optimization with Probabilistic Constraints , 2008, SIAM J. Optim..

[6]  Alexander Shapiro,et al.  Convex Approximations of Chance Constrained Programs , 2006, SIAM J. Optim..

[7]  A. Kleywegt,et al.  Distributionally Robust Stochastic Optimization with Wasserstein Distance , 2016, Math. Oper. Res..

[8]  Xiang Li,et al.  Probabilistically Constrained Linear Programs and Risk-Adjusted Controller Design , 2005, SIAM J. Optim..

[9]  András Prékopa Static Stochastic Programming Models , 1995 .

[10]  András Prékopa,et al.  ON PROBABILISTIC CONSTRAINED PROGRAMMING , 2015 .

[11]  Tamás Szántai,et al.  Computing bounds for the probability of the union of events by different methods , 2012, Ann. Oper. Res..

[12]  Melvyn Sim,et al.  From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization , 2010, Oper. Res..

[13]  Shabbir Ahmed,et al.  Convex relaxations of chance constrained optimization problems , 2014, Optim. Lett..

[14]  Weijun Xie,et al.  Distributionally Robust Chance Constrained Optimal Power Flow with Renewables: A Conic Reformulation , 2018, IEEE Transactions on Power Systems.

[15]  Yinyu Ye,et al.  Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems , 2010, Oper. Res..

[16]  Daniel Kuhn,et al.  Distributionally Robust Convex Optimization , 2014, Oper. Res..

[17]  Daniel Kuhn,et al.  Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations , 2015, Mathematical Programming.

[18]  Ruiwei Jiang,et al.  Distributionally Robust Chance-Constrained Bin Packing , 2016 .

[19]  L. Rüschendorf Sharpness of Fréchet-bounds , 1981 .

[20]  David J. Hunter An upper bound for the probability of a union , 1976, Journal of Applied Probability.

[21]  Daniel Kuhn,et al.  A distributionally robust perspective on uncertainty quantification and chance constrained programming , 2015, Mathematical Programming.

[22]  Michael R. Wagner Stochastic 0-1 linear programming under limited distributional information , 2008, Oper. Res. Lett..

[23]  Garth P. McCormick,et al.  Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..

[24]  Roger J.-B. Wets,et al.  Stochastic Programming: Solution Techniques and Approximation Schemes , 1982, ISMP.

[25]  G. Calafiore,et al.  On Distributionally Robust Chance-Constrained Linear Programs , 2006 .

[26]  Bowen Li,et al.  Ambiguous risk constraints with moment and unimodality information , 2019, Math. Program..

[27]  Fady Alajaji,et al.  A lower bound on the probability of a finite union of events , 2000, Discret. Math..

[28]  Daniel Kuhn,et al.  Ambiguous Joint Chance Constraints Under Mean and Dispersion Information , 2017, Oper. Res..

[29]  R. Tyrrell Rockafellar,et al.  Variational Analysis , 1998, Grundlehren der mathematischen Wissenschaften.

[30]  James R. Luedtke,et al.  Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs , 2016, Mathematical Programming.

[31]  Alexander Shapiro,et al.  Minimax analysis of stochastic problems , 2002, Optim. Methods Softw..

[32]  R. Rockafellar,et al.  Optimization of conditional value-at risk , 2000 .

[33]  A. Nemirovski,et al.  Scenario Approximations of Chance Constraints , 2006 .

[34]  James R. Luedtke,et al.  Chance-Constrained Binary Packing Problems , 2014, INFORMS J. Comput..

[35]  Thomas A. Henzinger,et al.  Probabilistic programming , 2014, FOSE.

[36]  András Prékopa,et al.  Bounding the probability of the union of events by aggregation and disaggregation in linear programs , 2005, Discret. Appl. Math..

[37]  András Prékopa,et al.  On the concavity of multivariate probability distribution functions , 2001, Oper. Res. Lett..

[38]  Ruiwei Jiang,et al.  Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information , 2016, SIAM J. Optim..

[39]  Abdel Lisser,et al.  Partial sample average approximation method for chance constrained problems , 2018, Optimization Letters.

[40]  Roger J.-B. Wets,et al.  Chapter VIII Stochastic programming , 1989 .

[41]  Laurent El Ghaoui,et al.  Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach , 2003, Oper. Res..

[42]  Daniel Kuhn,et al.  Distributionally robust joint chance constraints with second-order moment information , 2011, Mathematical Programming.

[43]  S. Kataoka A Stochastic Programming Model , 1963 .

[44]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[45]  George L. Nemhauser,et al.  An integer programming approach for linear programs with probabilistic constraints , 2010, Math. Program..

[46]  M. Fréchet Généralisation du théorème des probabilités totales , 1935 .