An exterior-point method for linear programming problems
- 129 Downloads
This paper proves the convergence of an algorithm for solving linear programming problems inO(mn2) arithmetic operations. The method is called an exterior-point procedure, because it obtains a sequence of approximations falling outside the setU of feasible solutions. Each iteration consists of a single step within some constraining hyperplane, followed by one or more projections which force the new approximation to fall within some envelope aboutU. The paper also discusses several numerical applications. In some types of problems, the method is considerably faster than a standard simplex method program when the size of the problem is sufficiently large.
Key WordsLinear programming polynomial time algorithms
Unable to display preview. Download preview PDF.
- 2.Gonzaga, C. C.,An Algorithm for Solving Linear Programming Problems in O(n 3L)Operations, Progress in Mathematical Programming: Interior and Related Methods, Edited by N. Megiddo, Springer Verlag, New York, New York, pp. 1–28, 1989.Google Scholar
- 3.Karmarkar, N.,A New Polynomial Time Algorithm for Linear Programming, Combinatorica, Vol. 4, pp. 373–395, 1984.Google Scholar