Lagrangean decomposition for large-scale two-stage stochastic mixed 0-1 problems
In this paper we study solution methods for solving the dual problem corresponding to the Lagrangean Decomposition of two stage stochastic mixed 0-1 models. We represent the two stage stochastic mixed 0-1 problem by a splitting variable representation of the deterministic equivalent model, where 0-1 and continuous variables appear at any stage. Lagrangean Decomposition is proposed for satisfying both the integrality constraints for the 0-1 variables and the non-anticipativity constraints. We compare the performance of four iterative algorithms based on dual Lagrangean Decomposition schemes, as the Subgradient method, the Volume algorithm, the Progressive Hedging algorithm and the Dynamic Constrained Cutting Plane scheme. We test the conditions and properties of convergence for medium and large-scale dimension stochastic problems. Computational results are reported.
|Date of creation:||Jul 2010|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: + 34 94 601 3740
Fax: + 34 94 601 4935
Web page: http://www.ea3.ehu.es
More information through EDIRC
|Order Information:|| Postal: Dpto. de Econometría y Estadística, Facultad de CC. Económicas y Empresariales, Universidad del País Vasco, Avda. Lehendakari Aguirre 83, 48015 Bilbao, Spain|
When requesting a correction, please mention this item's handle: RePEc:ehu:biltok:201007. 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: (Alcira Macías)
If references are entirely missing, you can add them using this form.