Decomposition Algorithms for Stochastic Programming on a Computational Grid

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.

[1]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[2]  R. Wets,et al.  L-SHAPED LINEAR PROGRAMS WITH APPLICATIONS TO OPTIMAL CONTROL AND STOCHASTIC PROGRAMMING. , 1969 .

[3]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[4]  Andrzej Ruszczynski,et al.  A regularized decomposition method for minimizing a sum of polyhedral functions , 1986, Math. Program..

[5]  Alan J. King,et al.  A Standard Input Format for Multiperiod Stochastic Linear Programs , 1987 .

[6]  J. Birge,et al.  Computing block-angular Karmarkar projections with applications to stochastic programming , 1988 .

[7]  Krzysztof C. Kiwiel,et al.  Proximity control in bundle methods for convex nondifferentiable minimization , 1990, Math. Program..

[8]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[9]  J. Burkey,et al.  WEAK SHARP MINIMA IN MATHEMATICAL PROGRAMMING , 1993 .

[10]  Andrzej Ruszczynski,et al.  Parallel decomposition of multistage stochastic programming problems , 1993, Math. Program..

[11]  Robert D. Doverspike,et al.  Network planning with random demand , 1994, Telecommun. Syst..

[12]  John M. Mulvey,et al.  A New Scenario Decomposition Method for Large-Scale Stochastic Optimization , 1995, Oper. Res..

[13]  Jean-Philippe Vial,et al.  A cutting plane method from analytic centers for stochastic programming , 1995, Math. Program..

[14]  A. Ruszczynski,et al.  On the Regularized Decomposition Method for Two Stage Stochastic Linear Problems , 1996 .

[15]  John R. Birge,et al.  A parallel implementation of the nested decomposition algorithm for multistage stochastic linear programs , 1996, Math. Program..

[16]  Roland Wunderling,et al.  Paralleler und objektorientierter Simplex-Algorithmus , 1996 .

[17]  Miron Livny,et al.  Mechanisms for High Throughput Computing , 1997 .

[18]  J. Gondizo,et al.  Warm Start and ε-Subgradients in a Cutting Plane Scheme for Block-Angular Linear Programs , 1999, Comput. Optim. Appl..

[19]  Jeff Linderoth,et al.  Metacomputing and the Master-Worker Paradigm , 2000 .

[20]  Jeff T. Linderoth,et al.  An enabling framework for master-worker applications on the Computational Grid , 2000, Proceedings the Ninth International Symposium on High-Performance Distributed Computing.

[21]  Alexander Shapiro,et al.  On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs , 2000, SIAM J. Optim..

[22]  Jacek Gondzio,et al.  Building and Solving Large-Scale Stochastic Programs on an Affordable Distributed Computing System , 2000, Ann. Oper. Res..

[23]  Horand I. Gassmann,et al.  A Comprehensive Input Format for Stochastic Linear Programs , 2001, Ann. Oper. Res..

[24]  Stephen J. Wright,et al.  Near-optimal adaptive control of a large grid application , 2002, ICS '02.

[25]  Jeff T. Linderoth,et al.  Master–Worker: An Enabling Framework for Applications on the Computational Grid , 2001, Cluster Computing.

[26]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[27]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .