On the Regularized Decomposition Method for Two Stage Stochastic Linear Problems
A new approach to the regularized decomposition (RD) algorithm for two stage stochastic problems is presented. The RD method combines the ideas of the Dantzig-Wolfe decomposition principle and modern nonsmooth optimization methods. A new subproblem solution method using the primal simplex algorithm for linear programming is proposed and then tested on a number of large scale problems. The new approach makes it possible to use a more general problem formulation and thus allows considerably more freedom when creating the model. The computational results are highly encouraging.
|Date of creation:||Feb 1996|
|Contact details of provider:|| Postal: A-2361 Laxenburg|
Web page: http://www.iiasa.ac.at/Publications/Catalog/PUB_ONLINE.html
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- A. Swietanowski, 1995. "A Penalty Based Simplex Method for Linear Programming," Working Papers wp95005, International Institute for Applied Systems Analysis.
- A. Ruszczynski, 1993. "Regularized Decomposition of Stochastic Programs: Algorithmic Techniques and Numerical Results," Working Papers wp93021, International Institute for Applied Systems Analysis.
- Birge, John R. & Louveaux, Francois V., 1988. "A multicut algorithm for two-stage stochastic linear programs," European Journal of Operational Research, Elsevier, vol. 34(3), pages 384-392, March.
When requesting a correction, please mention this item's handle: RePEc:wop:iasawp:wp96014. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.