An exterior-point method for linear programming problems

Journal of Optimization Theory and Applications

Volumn 91, Issue 3, 1996, Pages 561-583

  Andrus, J F ^a   Schaferkotter, M R ^a  

^a UNIVERSITY OF NEW ORLEANS   (United States)

Author keywords

Linear programming; Polynomial time algorithms

Indexed keywords

ITERATIVE METHODS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

ALGORITHM FOR SOLVING; ARITHMETIC OPERATIONS; FEASIBLE SOLUTION; LINEAR PROGRAMMING PROBLEM; LINEAR-PROGRAMMING; NUMERICAL APPLICATIONS; POINT METHODS; POLYNOMIAL-TIME ALGORITHMS; SINGLE-STEP; STANDARD SIMPLEX METHOD;

LINEAR PROGRAMMING;

EID: 0030355659     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02190122     Document Type: Article

References (8)

1. ANDRUS, J. F., An Exterior-Point Method for the Convex Programming Problem, Journal of Optimization Theory and Applications, Vol. 72, pp. 37-63, 1992.
2. 3L) Operations, Progress in Mathematical Programming: Interior and Related Methods, Edited by N. Megiddo, Springer Verlag, New York, New York, pp. 1-28, 1989.
3. KARMARKAR, N., A New Polynomial Time Algorithm for Linear Programming, Combinatorica, Vol. 4, pp. 373-395, 1984.
4. KHACHIAN, L. G., Polynomial Algorithms in Linear Programming, USSR Computational Mathematics and Mathematical Physics, Vol. 20, pp. 53-72, 1980.
5. MONTEIRO, R. D. C., and ADLER, I., Interior Path Following Primal-Dual Algorithms, Part 1: Linear Programming, Mathematical Programming, Vol. 44, pp. 27-41, 1989.
6. RENEGAR, J., A Polynomial-Time Algorithm, Based on Newton's Method, for Linear Programming, Mathematical Programming, Vol. 40, pp. 59-93, 1988.
7. 1.5n)L) Arithmetic Operations, Mathematical Programming, Vol. 47, pp. 175-201, 1990.
8. 1-Approximation Codes, Computers and Operations Research, Vol. 14, pp. 435-447, 1987.