Article ID: | iaor1990300 |
Country: | Switzerland |
Volume: | 22 |
Start Page Number: | 55 |
End Page Number: | 70 |
Publication Date: | Jan 1990 |
Journal: | Annals of Operations Research |
Authors: | Shanno David F., Bagchi Ansuman |
The paper shows how various interior point methods for linear programming may all be derived from logarithmic barrier methods. These methods include primal and dual projective methods, affine methods, and methods based on the method of centers. In particular, the paper demonstrates that Karmarkar’s algorithm is equivalent to a classical logarithmic barrier method applied to a problem in standard form.