Abstract
We describe the convergence behavior of Karmarkar's projective algorithm for solving a simple linear program. We show that the algorithm requires at least n − 1 iterations to reach the optimal solution, while the simplex method may need one pivot step. Thus in the worst case, Karmarkar's algorithm will require at least Ω(n) iterations to converge.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
