|edoc-Server der Humboldt-Universität zu Berlin|
|Author(s):||Csaba I. Fábián, Eötvös Loránd University Budapest||Title:||Adapting an approximate level method to the two-stage stochastic programming problem|
|Date of Acceptance:||05.11.2001|
Stochastic Programming E-Print Series |
|Editors:||Julie L. Higle; Werner Römisch; Surrajeet Sen|
|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.|
|Diese Seite taggen: These icons lead to social bookmarking systems where you can create and manage personal bookmarks and discover bookmakrs of other users.|
|We present a decomposition method for the solution of stwo-stage stochastic programming problems. This is an approximate method that can handle problems with large number scenarios. At the beginning, only rough approximation of the objective function is required. As the optimum is gradually approached, more and more accurate data are computed. The required accuracy is known at each step, hence efforts can be coordinated. The present framwork enables the application of interior-point methods because the convergence proof does not rely on basic solutions. Moreover, the classic discretization methods and stochastic approximation schemes naturally fit into the present framework.|
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: