A Modified Termination Rule for Karmarkar’s Algorithm

DOI10.1080/02522667.1995.10699255zbMath0860.90089OpenAlexW2063198537MaRDI QIDQ4718617

No author found.

Publication date: 8 December 1996

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

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

zbMATH Keywords

Karmarkar's algorithmmodified termination rule

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• On the improvement per iteration in Karmarkar's algorithm for linear programming
• Intelligent gradient search in linear programming
• A different convergence proof of the projective method for linear programming
• The iterative step in the linear programming algorithm of N. Karmarkar
• The Worst-Case Step in Karmarkar's Algorithm
• Convergence in Karmarkar's algorithm: a review

This page was built for publication: A Modified Termination Rule for Karmarkar’s Algorithm