The affine-scaling direction for linear programming is a limit of projective-scaling directions

DOI10.1016/0024-3795(91)90268-2zbMath0729.65041OpenAlexW2082565038WikidataQ114852082 ScholiaQ114852082MaRDI QIDQ806963

Michael J. Todd

Publication date: 1991

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

Full work available at URL: https://hdl.handle.net/1813/8717

zbMATH Keywords

linear programmingKarmarker algorithmaffine-scaling algorithmprojective-scaling algorithm

Mathematics Subject Classification ID

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

Related Items (1)

Loss and retention of accuracy in affine scaling methods

Cites Work

• 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
• Search directions for interior linear-programming methods
• A variation on Karmarkar’s algorithm for solving linear programming problems
• 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
• Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
• A Variant of Karmarkar’s Linear Programming Algorithm for Problems with Some Unrestricted Variables
• Boundary Behavior of Interior Point Algorithms in Linear Programming

This page was built for publication: The affine-scaling direction for linear programming is a limit of projective-scaling directions