Abstract
In this note we consider the worst-case performance in a single step of Karmarkar's projective algorithm for linear programming. In the transformed problem which arises on each iteration we show that the critical ratio “r/R” can be improved (asymptotically) by a factor of two. We also show that in the original problem, where performance is characterized by reduction in the potential function, the worst-case reduction can be improved to approximately 0.72. Moreover, we demonstrate that both of these bounds are tight, so that no further improvement based on the analysis of a single step is possible.
Sign-in/Register to access full text options 
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.
