Work

A compact implementation of a recently proposed strongly polynomial-time algorithm for the general LP problem

Year: 2025

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2505.01426

Author: Awoniyi, Samuel

Institution: Florida A&M University - Florida State University College of Engineering

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4416059504

Cites:

Cited by:

Related to: