|edoc-Server der Humboldt-Universität zu Berlin|
Willem K. Klein Haneveld, University of Groningen|
Maarten H. van der Vlerk, University of Groningen
|Title:||Integrated chance constraints – reduced forms and an algorithm|
|Date of Acceptance:||29.07.2002|
Stochastic Programming E-Print Series |
|Editors:||Julie L. Higle; Werner Römisch; Surrajeet Sen|
|Keywords (eng):||chance constraints, simple recourse, algorithm|
Computational management science |
|Metadata export: To export the complete metadata set as Endote or Bibtex format please click to the appropriate link.||Endnote Bibtex|
|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.|
These data concerning access statistics for individual documents
have been compiled using the webserver log files aggregated by AWSTATS.
They refer to a monthly access count to the full text documents as well as to the entry page.
As for format versions of a document which consist of multiple files (such as HTML) the highest monthly access number to one of the files (chapters) is shown respectivly.
To see the detailled access numbers please move the mouse pointer over the single bars of the digaram.
Gesamtzahl der Zugriffe seit May 2011: