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.

Successive Linear Programming (SLP) algorithms solve nonlinear optimization problems via a sequence of linear programs. They have been widely used, particularly in the oil and chemical industries, ...