|edoc-Server der Humboldt-Universität zu Berlin|
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|
Stochastic Programming E-Print Series |
|Editors:||Julie L. Higle; Werner Römisch; Surrajeet Sen|
|Keywords (eng):||stochastic integer programming, test sets, decomposition methods|
|Metadata export: To export the complete metadata set as Endote or Bibtex format please click to the appropriate link.||Endnote Bibtex|
|print on demand: If you click on this icon you can order a print copy of this publication.|
|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.|
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 Jul 2011: