The paper gives a view of interior point methods for linear programming inspired by the work of Karmarkur. Two possible classifications of the existing methods are presented through the detailed discussion of typical representatives. The paper also discusses some implementation details and provides a selected bibliography.