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

2023/09/02 by Samuel Awoniyi, Awoniyi, Samuel
Computer Science · Engineering · Mathematics · #Advanced Control Systems Optimization #Advanced Optimization Algorithms Research #FOS: Mathematics #Optimization and Control (math.OC) #Polynomial and algebraic computation

paper · pdf · doi:10.48550/arxiv.2309.01037

openalex publication_date 2023/09/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• A compact implementation of a recently proposed strongly polynomial-time algorithm for the general LP problem
• Validation of a strongly polynomial-time algorithm for the general linear programming problem
• A strongly polynomial-time algorithm for the general linear programming problem
• The existence of a strongly polynomial time simplex algorithm for linear programs
• A polynomial projection-type algorithm for linear programming