A new polynomial-time algorithm for linear programming

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1984, Pages 302-311

  Karmarkar, N ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; LINEAR PROGRAMMING; SPHERES;

ELLIPSOID ALGORITHM; INTERIOR POINT; OPTIMAL SOLUTIONS; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; PROJECTIVE TRANSFORMATION; REPEATED APPLICATION; RUNNING TIME;

POLYNOMIAL APPROXIMATION;

EID: 85046380112     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800057.808695     Document Type: Conference Paper

References (4)

1. I. V. Klee and G.L. Minty, "How good is the simplex algorithm?" in O. Shisha (ed.) Inequalities Ill, Academic Press, New York, 1972, p. 159-179.
2. L.G. Khachiyan, "'A polynomial Algorithm in Linear Programming, " Doklady Akademiia Nauk SSSR 244:S (1979), p. 1093-1096, translated in Soviet Mathematics Doklady 20:1 (1979), p. 191-194.
3. M. Grotschel, L. Lovasz, A. Schrijver, Then Ellipsoid Method and its Consequences in Combinatorial Optimization, Combinatorica I (2) 1981, p. 169-197.
4. Dantzig, G.B., Linear Programming and Extensions, Princeton University Press, Princeton, NJ (1963).