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.

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...