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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have