A unified view of interior point methods for linear programming (Q803041)

After Karmarkar's publication of a polynomial time algorithm to solve linear programming problems various interior point methods were presented by a number of researchers. These methods include primal and dual projective methods, affine methods, and methods based on the method of centers. In this paper the authors show that all the above methods are simple variants of the logarithmic barrier method applied to the primal, dual, or primal and dual problem together. In particular, they indicate that Karmarkar's algorithm is equivalent to a classical logarithmic barrier method applied to a problem in standard form.