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.

This is a preview. Log in through your library . Abstract In this paper, a modification of the bisection simplex method is made for more general purpose use. Organized in an alternative simpler form, ...