Convexity of Chance Constraints with Dependent Random Variables: The Use of Copulae
暂无分享,去创建一个
We consider the convexity of chance constraints with random right-hand side. While this issue is well understood (thanks to Prekopa’s Theorem) if the mapping operating on the decision vector is componentwise concave, things become more delicate when relaxing the concavity property. In an earlier paper, the significantly weaker r-concavity concept could be exploited, in order to derive eventual convexity (starting from a certain probability level) for feasible sets defined by chance constraints. This result heavily relied on the assumption of the random vector having independent components. A generalization to arbitrary multivariate distributions is all but straightforward. The aim of this chapter is to derive the same convexity result for distributions modeled via copulae. In this way, correlated components are admitted, but a certain correlation structure is imposed through the choice of the copula. We identify a class of copulae admitting eventually convex chance constraints.
[1] René Henrion,et al. Convexity of chance constraints with independent random variables , 2008, Comput. Optim. Appl..
[2] Peter Kall,et al. Stochastic Programming , 1995 .
[3] R. Wets,et al. Stochastic programming , 1989 .
[4] Bill Ravens,et al. An Introduction to Copulas , 2000, Technometrics.
[5] C. Klaassen,et al. Efficient estimation in the bivariate normal copula model: normal margins are least favourable , 1997 .