Learn More
We show that a polynomial-time rescaling algorithm, in [5], for finding feasible solutions to linear programs, has flaws in its theoretical framework. With new estimates for the algorithm, we show that it indeed terminates in polynomial time. Also, we present a modification of the algorithm, where we suggest a data dependent way of choosing a rescaling(More)
  • 1