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

DOI10.1007/BF01840462MaRDI QIDQ1089252zbMATH OpenFDO

Authors C. E. Blair

Publication date 1986

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01840462

zbMATH Keywords

improvementKarmarkar's algorithm

Mathematics Subject Classification ID

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

Review text

We simplify and strengthen the analysis of the improvement obtained in one step of Karmarkar's algorithm [see \textit{N. Karmarkar}, Combinatorica 4, 373-395 (1984; Zbl 0557.90065)].

Cites work

• A different convergence proof of the projective method for linear programming
• A new polynomial-time algorithm for linear programming
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)

Cited in

(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
• A Modified Termination Rule for Karmarkar’s Algorithm
• Asymptotic behaviour of Karmarkar's method for linear programming
• On the improvement per iteration in Karmarkar's algorithm for linear programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089252)