Solving sequences of refined multistage stochastic linear programs

Multistage stochastic programs with continuous underlying distributions involve the obstacle of high-dimensional integrals where the integrands' values again are given by solutions of stochastic programs. A common solution technique consists of discretizing the support of the original distributions leading to scenario trees and corresponding LPs which are – up to a certain size – easy to solve. In order to improve the accuracy of approximation, successive refinements of the support result in rapidly expanding scenario trees and associated LPs. Hence, the solvability of the multistage stochastic program is limited by the numerical solvability of sequences of such expanding LPs. This work describes an algorithmic technique for solving the large-scale LP of refinement v based on the solution at the previous v – 1 refinements. Numerical results are presented for practical problem statements with financial applications demonstrating significant speedup (depending on the size of the LP instances).