The Dual Matrix Algorithm for Linear Programming.

The Dual Matrix Algorithm, variations of which were proposed in [A.Yu.Levin 65] and [Yamnitsky, Levin 82], has little sensitivity to numerical errors and to the number of inequalities. It offers substantial flexibility and, thus, potential for further development.