## Ambiguous Chance Constrained Problems And Robust Optimization (2004)

### Cached

### Download Links

- [www.corc.ieor.columbia.edu]
- [edoc.hu-berlin.de]
- DBLP

### Other Repositories/Bibliography

Venue: | Mathematical Programming |

Citations: | 35 - 1 self |

### BibTeX

@INPROCEEDINGS{Erdogan04ambiguouschance,

author = {E. Erdogan and G. Iyengar},

title = {Ambiguous Chance Constrained Problems And Robust Optimization},

booktitle = {Mathematical Programming},

year = {2004},

pages = {37--61}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this paper we study ambiguous chance constrained problems where the distributions of the random parameters in the problem are themselves uncertain. We primarily focus on the special case where the uncertainty set Q of the distributions is of the form Q = {Q : # p (Q, Q 0 ) # #}, where # p denotes the Prohorov metric. The ambiguous chance constrained problem is approximated by a robust sampled problem where each constraint is a robust constraint centered at a sample drawn according to the central measure Q 0 . The main contribution of this paper is to show that the robust sampled problem is a good approximation for the ambiguous chance constrained problem with high probability. This result is established using the Strassen-Dudley Representation Theorem that states that when the distributions of two random variables are close in the Prohorov metric one can construct a coupling of the random variables such that the samples are close with high probability. We also show that the robust sampled problem can be solved e#ciently both in theory and in practice. 1