Speeding up Chubanov’s Basic Procedure Published: 2014/09/19 Cornelis RoosCategories Linear Programming, Linear, Cone and Semidefinite Programming Tags linear homogeneous systems, polynomial-time Short URL: https://optimization-online.org/?p=13058 It is shown that a recently proposed method by Chubanov for solving linear homogeneous systems with positive variables can be improved, both theoretically and computationally. CitationTU Delft, September 2014ArticleDownload View PDF