Dimensional Reduction Variant of Khachian's Algorithm for Linear Programming Problems.

摘要

A technique for dimensional reduction is combined with Khachian's algorithm and another acceleration technique to solve linear programing problems. The new method yields exact rather than approximate solutions, and provides a natural procedure for determining infeasibility. 7 figures. (ERA citation 05:023403)