Dimensional Reduction Variant of the Ellipsoid Algorithm for Linear Programming Problems

Abstract

A technique for dimensional reduction is combined with the ellipsoid algorithm and another acceleration technique lo solve linear programming problems. The new method yields exact rather than approximate solutions and provides a natural procedure for determining infeasibility.