Abstract:
A family of interior point algorithms for solving linear programs is examined. Under the assumption on the nondegeneracy of the problem, a theoretical justification of these algorithms is given. The sets of the algorithms converging to relatively interior optimal solutions and having linear or superlinear convergence rate are identified.
Key words:linear programming, interior point method, linear and superlinear convergence of interior point algorithms.
Fulltext:
PDF file (1854 kB)