On a distributed implementation of a decomposition method for multistage linear stochastic programs

References

• Bach , M. 1986 . “ The Design Of The UNIX Operating System ” . Englewood Cliffs, NJ : Prentic Hall .
   Google Scholar
• Ben-Ari , M. 1982 . “ Principles Of Concurrent Programming ” . Englewood Cliffs, NJ : Prentice Hall .
   Google Scholar
• Ben-Ari , M. 1990 . “ Principles Of Concurrent And Distributed Programming ” . Englewood Cliffs, NJ : Prentice Hall .
   Google Scholar
• Bestsekas , D.P. and Tsitsiklis , J.N. 1989 . “ Parallel And Distributed Computation ” . Englewood Cliffs, NJ : Prentic Hall .
   Google Scholar
• Birge J. R. Donohue C.J. Holmes D. F. Svintsitki O. G. A Parallel Implementation Of The Nested Dcomposition Algorithm For Multistage Stochastic Linear Programs 1994 Technical Report 94-1, Department Of Industrial And Operations Engineering, University Of Michigan, Ann Arbor. ML
   Google Scholar
• Brige , J.R. and Holmes , D.F. 1992 . Efficient Solutions Of Two-Stage Stochastic Linear Programs Using Interior Point Methods . Comptational Optimization And Applications , 1 : 245 – 276 .
   Google Scholar
• Brige , J.R. and Louveaux , F.V. 1988 . A Multicut Algorithm For Two-Stage Stochastic Linear Programs . Europeans Journal Of Operations Research , 34 : 384 – 392 .
   Google Scholar
• Brige , J.R. 1985 . Decomposition And Partitioning Methods For Multistage Stochastic Linear Programs . Operations Research , 33 : 989 – 1007 .
   Google Scholar
• Bisschops , J. and Meeraus , A. 1984 . Matrix Augentation And Partitioning In The Updating Of The Basis Inverse , 30 : 71 – 87 . Mathematical Progamming
   Google Scholar
• Dantzig , G.B. and Glynn , P.W. 1990 . Parallel Processors For Planning Under Uncertainty . Annals Of Operations Research , 22 : 1 – 21 .
   Google Scholar
• Dantzig , G.B. and Madansky , A. 1961 . On The Solution Of Two-Stage Linear Programs Under Uncertainty . In Proc. 4th Berkeley Symposium On Mathematical Statistics And Probability . 1961 , Berkeley, CA. Vol. 1 , pp. 165 – 176 . University Of California Press .
   Google Scholar
• Dantzig , G.B. and Wolfe , P. 1960 . Decomposition Principle For Linear Programming . Operations Research , 8 : 101 – 111 .
   Web of Science ®Google Scholar
• Ermoliev , J. “ Metody Stockchasticestskowo Programirowanija ” .
   Google Scholar
• Fourer , F. 1982 . Solving Staircase Linear Programs By the Simplex Method, 1 . Mathematical Programming , 23 : 274 – 313 . Inversion
   Google Scholar
• Fourer , F. 1983 . Solving Staircase Linear Programs by the Simplex Method, 2 . Mathematical Programming , 25 : 251 – 292 . Pricing
   Google Scholar
• Gassmann , H.I. 1990 . MSLiP: A Computer Code For The Multistage Stochastic Linear Programming Probelm . Mathematical Programming , 47 : 407 – 423 .
   Web of Science ®Google Scholar
• Geist , G.A. and Sunderam , V.S. 1993 . The Evolution Of The PVM Concurrent Computing System . In Proc. 26th IEEE Compcon Symposium . February 1993 , San Francisco. pp. 471 – 478 .
   Google Scholar
• Ho , J.K. and Manne , A.S. 1974 . Nested Decomposition For Dynamic Models . Mathematical programming , 6 February : 121 – 140 .
   Google Scholar
• Kall , P. 1979 . Computational Method For Solving Two-Stage Stochastic Linear Programming Problems . ZAMT , 30 February : 261 – 271 .
   Web of Science ®Google Scholar
• Lasdon , L.S. 1970 . “ Optimization Theory For Large Systems ” . New York : MacMillan .
   Google Scholar
• Lusting , I.J. , Mulvey , J.M. and Carpenter , T.J. 1991 . Formulating Two-Stage Stochastic Programs for Interior Point Methods . Operators Research , 39 : 757 – 770 .
   Google Scholar
• Rockafellar , R.T. and Wets , R.J.-B. 1991 . Scenarious and Policy Aggregation in Optimization Under Uncertainty . Mathematics Of Operations Research , 16 : 119 – 147 .
   Web of Science ®Google Scholar
• Rockafellar , R.T. and Wets , R.J.-B. 1986 . A Lagrangian Finite Generation Techniqe for Solving Linear Quadratic Problems in Stochastic Programming . Mathematical Programming Study , 28 : 63 – 93 .
   Google Scholar
• Ruszczynski , A. 1993 . Parallel Decomposition Of Multistage Programming Problems . Mathematical Programming , 58 : 201 – 228 .
   Web of Science ®Google Scholar
• Ruszczynski , A. Regularized Decomposition and Augmented Lagrangian Decomposition for Angular Linear Programming Problems , Edited by: Lewandowski , A. and Wierzbicki , A. 80 – 91 . Berlin : Springer . Aspiration Based Decision Support Systems, Lecture Notes in Economics and Mathematical Systems No.331
   Google Scholar
• Ruszczynski , A. 1989 . An Augmented Lagrangian Decomposition Method for Block Diagonal Linear Programming Problems . Operations Research Letters , 8 : 287 – 294 .
   Google Scholar
• Ruszczynski , A. 1986 . A Regularized Decomposition Method for Minimizing a Sum of Polyhedral Functions . Mathematical Programming , 35 : 309 – 333 .
   Web of Science ®Google Scholar
• Santifaller , M. TCP/IP and NFS, Internetworking in a UNIX Environment, Adison– , Wesley : GmbH .
   Google Scholar
• Strazicky , B. 1980 . “ Some Results Concerning an Algorithm for the Discrete Recourse Problems ” . Edited by: Dempster , M. 263 – 274 . London : Academic Press . Stochastic Programming
   Google Scholar
• Valley , J. 1991 . UNIX Programmer's Reference , Que Corp . Carmel
   Google Scholar
• Van Slyke , R. and Wets , R.J.B. 1969 . L-Shaped Linear Prorams with Applications to Optimal Control and Stochastic Programming . SIAM Journal On Applied Mathematics , 17 : 638 – 663 .
   Web of Science ®Google Scholar
• Wets , R.J.B. 1988 . “ Large Scale Linear Programming Techniques ” . Edited by: Ermoliev , Yu. 65 – 94 . Berlin : Springer . Numerical Techniques for Stochastic Optimization
   Google Scholar
• Wittrock , R. 1985 . Dual Nested Decomposition Of Staircase Linear Programs . Mathematical Programming Study , 24 : 65 – 86 .
   Google Scholar
• Network Programming Guide Sun Microsystems USA 1990
   Google Scholar