A logarithmic barrier approach for linear programming

摘要

This paper presents a logarithmic barrier method for solving a linear programming problem. We are interested in computation of the direction by the Newton’s method and in computation of the displacement step using majorant functions instead line search methods in order to reduce the computation cost. This purpose is confirmed by numerical experiments, showing the efficiency of our approach, which are presented in the last section of this paper.