Integrated chance constraints: reduced forms and an algorithm
We consider integrated chance constraints (ICC), which provide quantitative alternatives for traditional chance constraints.We derive explicit polyhedral descriptions for the convex feasible sets induced by ICCs, for the case that the underlying distribution is discrete. Based on these reduced forms, we propose an efficient algorithm for this problem class. The relation to conditional value-at-risk models and (simple) recourse models is discussed, leading to a special purpose algorithm for simple recourse models with discretely distributed technology matrix. For both algorithms, numerical results are presented.
Year of publication: |
2002
|
---|---|
Authors: | Klein Haneveld, Willem K. ; Vlerk, Maarten H. van der |
Institutions: | Faculteit Economie en Bedrijfskunde, Rijksuniversiteit Groningen |
Saved in:
freely available
Saved in favorites
Similar items by person
-
Simple Integer Recourse Models: Convexity and Convex Approximations
Klein Haneveld, Willem K., (2004)
-
ALM model for pension funds : numerical results for a prototype model
Drijver, Sibrand J., (2002)
-
Convex approximations for complete integer recourse models
Vlerk, Maarten H. van der, (2002)
- More ...