A numerical illustration of a recently proposed strongly polynomial-time algorithm for the general linear programming problem

Abstract

This article presents a numerical illustration of a recently proposed strongly polynomial-time algorithm for the general linear programming (LP) problem. This article is essentially the first half of an article that describes the proposed algorithm. Each iteration of the algorithm consists of two Gauss-Jordan pivoting operations. The algorithm is terminated after at most 2(k+n) iterations, where k is the number of constraints of the LP problem and n is the number of variables. Illustrative example LP problems described in this article include a Klee-Minty LP problem and an LP problem of Beale.