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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Computational Mathematics and Mathematical Physics
Paper Title
Journal
Date
