The iterative step in the linear programming algorithm of N. Karmarkar

DOI10.1007/BF01840462zbMath0618.90058MaRDI QIDQ1089252

C. E. Blair

Publication date: 1986

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

improvementKarmarkar's algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (6)

Introduction: New approaches to linear programming ⋮ Convergence results and numerical experiments on a linear programming hybrid algorithm ⋮ Convergence in Karmarkar's algorithm: a review ⋮ Asymptotic behaviour of Karmarkar's method for linear programming ⋮ On the improvement per iteration in Karmarkar's algorithm for linear programming ⋮ A Modified Termination Rule for Karmarkar’s Algorithm

Cites Work

• A new polynomial-time algorithm for linear programming
• A different convergence proof of the projective method for linear programming
• Unnamed Item

This page was built for publication: The iterative step in the linear programming algorithm of N. Karmarkar