A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (Q486939)

The author proposes a strongly polynomial-time algorithm for the strict homogeneous linear- inequality feasibility problem in the positive orthant, that is, to obtain \(x \in \mathbb R^n\), such that \(A x > 0\), \(x >0\), for an \(m \times n\) matrix \(A\), \(m \leq n\). An extension to the non-homogeneous linear feasibility problem is presented.