ALTHOUGH any problem in linear programming can be solved by the simplex method, various other algorithms are in use, for special cases of linear program- ming problems. Their advantage is usually ...
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.
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback