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.

A method is proposed for finding a closed form expression for the cumulative distribution function (CDF) of the maximum value of the objective function in a stochastic linear programming problem in ...