
A problem of stochastic optimization with joint chance constraints is approximated by a problem of conditional value at risk which is attacked by the method of sample average approximation. The authors prove that under moderate conditions the optimal solutions and stationary points, obtained by applying the sample average approximation method, converge with probability one to their true counterparts. The exponential convergence rate is established for the convergence of stationary points. Similar convergence results for DC-approximation of chance constraints are listed where DC means an approximation by the difference of two convex functions. The results of numerical experiments are reported.
DC-approximation, exponential convergence, joint chance constraints, Stochastic programming, stationary point, CVaR, Statistical methods; risk measures
DC-approximation, exponential convergence, joint chance constraints, Stochastic programming, stationary point, CVaR, Statistical methods; risk measures
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 26 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
