Abstract

This paper presents an alternative technique for solving linear
programming problems. It is centered on finding a feasible interior point each time the feasible region is contracted, thus generating a sequence of feasible interior points that converge at the optimal solution of linear programming problem. The convergence of the algorithm is proved, and it is shown that the algorithm performs faster in a smaller feasible region.

This work is licensed under a Creative Commons Attribution 4.0 License.