
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.
There are 14 pages. This replacement includes more details of "directions for further work" as suggested by some readers. The last replacement introduced an improved data structure that is more efficient than the one being replaced and makes the article easier to review. The underlying algorithm is the same as before
Optimization and Control (math.OC), Optimization and Control, FOS: Mathematics, Math OC
Optimization and Control (math.OC), Optimization and Control, FOS: Mathematics, Math OC
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
