| edoc-Server der Humboldt-Universität zu Berlin |
| Author(s): |
Raymond Hemmecke, Gerhard-Mercator University Duisburg Rüdiger Schultz, Gerhard-Mercator University Duisburg | Title: | Decomposition of test sets in stochastic integer programming |
| Date of Acceptance: | 30.01.2001 |
| Submission Date: | 11.11.2000 |
| Series Title: |
Stochastic Programming E-Print Series (SPEPS) |
| Editors: | Julie L. Higle; Werner Römisch; Surrajeet Sen |
| Complete Preprint: |
pdf
(urn:nbn:de:kobv:11-10058091)
ps (urn:nbn:de:kobv:11-10058100) |
| Keywords (eng): | stochastic integer programming, test sets, decomposition methods |
| Metadata export:
|
Endnote Bibtex |
| print on demand:
|
|
| Diese Seite taggen:
|
| Abstract (eng): | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Graver test sets for linear two-stage stochastic integer programs are studied. It is shown that test sets can be decomposed into finitely many building blocks whose number is independent of the number of scenarios of the sochastic program. A finite algorithm to compute the building blocks directly, without prior knowledge of test set vectors, is presented. Once computed, building blocks can be employed to solve the stochastic program by a simple augmentation scheme, again without explicit knowledge of test set vectors. Preliminary computational experience is reported. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Access Statistics:
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:
|
|
| |||