A decomposition algorithm for multistage convex programs

The multistage or staircase structure appears naturally in many models with time horizons. This paper presents and discusses a decomposition algorithm when the problem functions are convex. The Dantzig-Wolfe convex programming algorithm is presented as one of the techniques available for solving the generated subproblems. Computational implementation of the algorithm and more efficient techniques in the presence of special structure are discussed.