Validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem
Abstract
This article presents a validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem. The proposed algorithm is an implicit reduction procedure that combines primal and dual linear programming problems into a special system of linear equations constrained by complementarity relations and non-negative variables. Each iteration of the algorithm consists of applying a pair of complementary Gauss-Jordan pivoting operations, guided by a necessary-condition lemma. This validation article demonstrates that the proposed algorithm requires no more than 2(k+n) iterations, where k is the number of constraints and n is the number of variables of given general linear programming problem.
Cite
@article{arxiv.2310.05855,
title = {Validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem},
author = {Samuel Awoniyi},
journal= {arXiv preprint arXiv:2310.05855},
year = {2026}
}
Comments
19 pages. This is an updating replacement of an earlier submission. The results are the same as before. The description have been vastly improved as a result of suggestions by reputable journal reviewers and area editors