A New Admissible Pivot Method for Linear Programming

Abstract

We present a new admissible pivot method for linear programming that works with a sequence of improving primal feasible interior points and dual feasible interior points. This method is a practicable variant of the short admissible pivot sequence algorithm, which was suggested by Fukuda and Terlaky. Here, we also show that this method can be modified to terminate in finite pivot steps. Finedly, we show that this method outperforms Terlalcy's criss-cross method by computational experiments.