The initial representation of an LP problem to which the Dantzig-Wolfe decomposition procedure is applied, is of the essence. We study this here, and, in particular, we consider two transformations of the problem, by introducing suitable linking rows and variables. We study the application of the Dantzig-Wolfe procedure to these new representations of the original problem and the relationship to previously proposed algorithms. Advantages and disadvantages from a computational viewpoint are discussed. Finally we develop a decomposition algorithm based upon these ideas for solving multistage staircase-structured LP problems
