Convergence behavior of Karmarkar’s projective algorithm for solving a simple linear program

Convergence behavior of Karmarkar’s projective algorithm for solving a simple linear program

0.00 Avg rating0 Votes
Article ID: iaor19921141
Country: Netherlands
Volume: 10
Issue: 7
Start Page Number: 389
End Page Number: 393
Publication Date: Oct 1991
Journal: Operations Research Letters
Authors: ,
Keywords: Karmarkar's method
Abstract:

The authors describe the convergence behavior of Karmarkar’s projective algorithm for solving a simple linear program. They 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.

Reviews

Required fields are marked *. Your email address will not be published.