Decomposition Algorithms for Stochastic Programming on a Computational Grid

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We describe algorithms for two-stage stochastic linear programming with recourse and their implementation on a grid computing platform. In particular, we examine serial and asynchronous versions of the L-shaped method and a trust-region method. The parallel platform of choice is the dynamic, heterogeneous, opportunistic platform provided by the Condor system. The algorithms are of master-worker type (with the workers being used to solve second-stage problems, and the MW runtime support library (which supports master-worker computations) is key to the implementation. Computational results are presented on large sample average approximations of problems from the literature.
44 pages

Keywords

Optimization and Control, 90C15; 65K05

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/61682

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0106151
 http://arxiv.org/abs/math/0106151

Collections

arXiv