Abstract
We present a generic projective interior point algorithm for linear programming which includes modified versions of Karmarkar's original algorithm and most other projective algorithms that have been proposed as special cases. We show that this class of algorithms has a worst case iteration bound of O(√nL) and is closely related to the class of potential reduction interior point methods.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
