Solving Stochastic Linear Programs on a Hypercube Multicomputer.
George B. Dantzig, James K. Ho, Gerd Infanger · 1991
Abstract : Large scale stochastic linear programs can be efficiently solved by using a blending of classical Benders decomposition and a relatively new technique called importance sampling. The paper demonstrates how such an approach can be effectively implemented on a parallel (Hypercube) multicomputer. Numerical results are presented.
Cited by 15 works. doi:10.21236/ada240443