Convergence in Karmarkar's algorithm: a review

DOI10.1080/0020739940250303zbMath0805.90075OpenAlexW2028510172MaRDI QIDQ4299921

No author found.

Publication date: 23 January 1995

Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020739940250303

zbMATH Keywords

convergence in Karmarkar's algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (2)

A Modified Termination Rule for Karmarkar’s Algorithm ⋮ Interior-point methods for linear programming: a review

Cites Work

• Unnamed Item
• A monotonic projective algorithm for fractional linear programming
• A new polynomial-time algorithm for linear programming
• A different convergence proof of the projective method for linear programming
• The iterative step in the linear programming algorithm of N. Karmarkar
• An extension of Karmarkar's algorithm for linear programming using dual variables
• A variation on Karmarkar’s algorithm for solving linear programming problems
• Convergence in Karmarkar’s Algorithm for Linear Programming
• The Worst-Case Step in Karmarkar's Algorithm
• Quasi-Newton Methods, Motivation and Theory

This page was built for publication: Convergence in Karmarkar's algorithm: a review