On monotonicity in the scaled potential algorithm for linear programming

DOI10.1016/0024-3795(91)90276-3zbMath0728.65058OpenAlexW2034761330WikidataQ114852074 ScholiaQ114852074MaRDI QIDQ805164

Kurt M. Anstreicher

Publication date: 1991

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(91)90276-3

zbMATH Keywords

affinely scaled potential reduction algorithmKarmarker algorithmScaled potential algorithms

Mathematics Subject Classification ID

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

Related Items

Combining phase I and phase II in a potential reduction algorithm for linear programming ⋮ Strict monotonicity in Todd's low-complexity algorithm for linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A monotonic projective algorithm for fractional linear programming
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• A polynomial Newton method for linear programming
• Conical projection algorithms for linear programming
• Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
• Generation of degenerate linear programming problems
• A variation on Karmarkar’s algorithm for solving linear programming problems
• A Centered Projective Algorithm for Linear Programming
• A variant of Karmarkar's linear programming algorithm for problems in standard form
• Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
• A Family of Search Directions for Karmarkar's Algorithm