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.
Roughly, we will cover the following topics (some of them may be skipped depending on the time available). Linear Programming: Basics, Simplex Algorithm, and Duality. Applications of Linear ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback