A compact implementation of a recently proposed strongly polynomial-time algorithm for the general LP problem
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912515499229184 |
|---|---|
| author | Awoniyi, Samuel |
| author_facet | Awoniyi, Samuel |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_01426 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A compact implementation of a recently proposed strongly polynomial-time algorithm for the general LP problem Awoniyi, Samuel Optimization and Control Math OC 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. |
| title | A compact implementation of a recently proposed strongly polynomial-time algorithm for the general LP problem |
| topic | Optimization and Control Math OC |
| url | https://arxiv.org/abs/2505.01426 |