Remarks on potential versus barrier function methods for linear programming

Some relations between potential and barrier function methods for linear programming will be pointed out. Then, based on the relations, it will be shown that the classical logarithmic barrier function method for linear programming can be adjusted so that it generates the optimal solution in iterations, where n is the number of variables and L is the data length. The method can be seen as a barrier function version of Ye's ‘An potential reduction algorithm for linear programming’.