Efficient parallel linear programming (Q1821686): Difference between revisions

Linear programming and least squares computations are accelerated using authors' parallel algorithms for solving linear systems. The implications on the performance of the Karmarkar and the simplex algorithms for dense and sparse linear programs are examined. The results have further applications to combinatorial algorithms.