The transportation method of linear programming is extended to a more general class of problem, for which the "stepping-stone method" of Charnes and Cooper fails. The method is applicable to various ...
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.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback