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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.