| 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 |
| Submission Date: | 04.09.2001 |
| 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-10058295)
ps (urn:nbn:de:kobv:11-10058304) |
| Metadata export:
|
Endnote Bibtex |
| print on demand:
|
|
| Diese Seite taggen:
|
| Abstract (eng): | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| 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. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| 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 Jul 2011:
|
|
| |||