This paper describes the Criss-Cross Method of solving linear programming problems. The method, a primal-dual scheme, normally begins with a problem solution that is neither primal nor dual feasible, ...
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