Strict monotonicity in Todd's low-complexity algorithm for linear programming

DOI10.1016/0167-6377(92)90023-VzbMath0767.90046MaRDI QIDQ1200765

Shinji Mizuno, Atsushi Nagasawa

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

potential functioninterior point algorithmstrictly monotone algorithm

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Some variants of the Todd low-complexity algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• On monotonicity in the scaled potential algorithm for linear programming
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• Todd's low-complexity algorithm is a predictor-corrector path-following method
• A variation on Karmarkar’s algorithm for solving linear programming problems