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.

George B. Dantzig, the mathematician who invented the field of linear programming, which revolutionized the way government and private enterprise planned, scheduled and generally conducted their ...