We propose a new decomposition method for large-scale linear programming. This method dualizes an (arbitrary) subset of the constraints and then maximizes the resulting dual functional by dual ascent.

An application of the transportation method of linear programming to a production planning problem of a large footwear manufacturer is described. Factors affecting the choice of approach are discussed ...