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. Each iteration of the proposed algorithm consists of two Gauss-Jordan pivoting operations. In this article, illustrative example LP problem instances include a Klee-Minty LP problem and an LP problem of Beale. The algorithm stops in at most 2(k+n) iterations, with a solution of (Eq) or, else, with an indication that (Eq) has no solutions, where k is the number of constraints of the LP problem instance stated in Neumann symmetric form, and n is the number of variables. One of the objectives of this numerical illustration article is to facilitate an understanding of how the recently proposed algorithm works.
Cite
@article{arxiv.2309.01037,
title = {A numerical illustration of a recently proposed strongly polynomial-time algorithm for the general linear programming problem},
author = {Samuel Awoniyi},
journal= {arXiv preprint arXiv:2309.01037},
year = {2026}
}
Comments
15 pages. This corrects a typo, by putting [18] in place of [1] in the "Introduction" and by now including [18] and [19]