A Modified Termination Rule for Karmarkar’s Algorithm

DOI10.1080/02522667.1995.10699255MaRDI QIDQ4718617zbMATH OpenOpenAlexFDO

Authors

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)

Recommendations

• scientific article; zbMATH DE number 969963
• A modification of Karmarkar's linear programming algorithm
• scientific article; zbMATH DE number 1135749
• scientific article; zbMATH DE number 123365

Cites work

• A different convergence proof of the projective method for linear programming
• A new polynomial-time algorithm for linear programming
• Convergence in Karmarkar's algorithm: a review
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• Intelligent gradient search in linear programming
• On the improvement per iteration in Karmarkar's algorithm for linear programming
• The iterative step in the linear programming algorithm of N. Karmarkar
• The Worst-Case Step in Karmarkar's Algorithm

Cited in

(3)

• On finite termination in the primal-dual method for linear programming
• Modifying Faugère's F5 algorithm to ensure termination
• scientific article; zbMATH DE number 969963 (Why is no real title available?)

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

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