An Implementation of a Primal-Dual Interior Point Method for Linear Programming.

The purpose of this paper is to describe in detail an implementation of a primal-dual interior point method for solving linear programming problems. Preliminary computational results indicate that this implementation compares favorably with a comparable implementation of a dual affine interior point method, and with MINOS 5.0, a state-of-the-art implementation of the simplex method. [ABSTRACT FROM AUTHOR]