A New Method for Linear Programming

摘要

In this paper, we present the main idea of a new exterior point method based on inclusive normal cones for solving the general linear programming problem in canonical form. An algorithm, termed targeted climbing ladder algorithm, is developed with proven finite convergence. The algorithms are tested by solving a number of linear programming examples. Initial numerical results have shown an encouraging performance.