On a Class of Interior Point Algorithms

摘要

A family of interior point algorithms for solving linear programs is examined. Under theassumption on the nondegeneracy of the problem, a theoretical justification of these algorithms isgiven. The sets of the algorithms converging to relatively interior optimal solutions and having linearor superlinear convergence rate are identified.