A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
The purpose of this paper is to present a new approach for solving linear programming, which has some interesting theoretical properties. In each step of the iteration, we trace a direction completely different from primal simplex method, dual simplex method, primal-dual method and interior point method. The new method is impervious to primal degeneracy and can reach a pair of exact primal and dual optimal solutions without purifying process. Numerical results are presented that support ourdoi:10.1080/10556788.2011.643889 fatcat:knc44rkne5ftdpxsxt5z2zywia