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 A method is proposed for finding a closed form expression for the cumulative distribution function (CDF) of the maximum value of the objective ...