On the finite convergence of interior-point algorithms for linear programming (Q687096): Difference between revisions

For a linear program a polynomial-time interior point algorithm is suggested, which generates an exact optimal solution on the optimal face in combination with a test projection procedure. Computational results are also reported. The concept of projecting an interior point into the optimal face is vital and very useful also for other algorithms.