A compact implementation of a recently proposed strongly polynomial-time algorithm for the general LP problem
Abstract
This article presents a compact implementation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem. Each iteration of the algorithm consists of applying a pair of complementary Gauss-Jordan (GJ) pivoting operations. In this compact implementation of the algorithm, the GJ pivoting operations are done inside a matrix that has half the size of the original matrix. A numerical illustration is given.
Cite
@article{arxiv.2505.01426,
title = {A compact implementation of a recently proposed strongly polynomial-time algorithm for the general LP problem},
author = {Samuel Awoniyi},
journal= {arXiv preprint arXiv:2505.01426},
year = {2025}
}
Comments
There are 14 pages. This replacement includes more details of "directions for further work" as suggested by some readers. The last replacement introduced an improved data structure that is more efficient than the one being replaced and makes the article easier to review. The underlying algorithm is the same as before