A Variant of Karmarkar’s Linear Programming Algorithm for Problems with Some Unrestricted Variables

DOI10.1137/0610003zbMath0667.65048OpenAlexW2041499478MaRDI QIDQ3819909

Michael J. Todd, John E. Mitchell

Publication date: 1989

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0610003

zbMATH Keywords

constrained least squares problemKarmarkar's algorithmunrestricted variablesprojective linear programming algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

On motivating the Mitchell-Todd modification of Karmarkar's algorithm for LP problems with free variables ⋮ Solving combinatorial optimization problems using Karmarkar's algorithm ⋮ The affine-scaling direction for linear programming is a limit of projective-scaling directions ⋮ Updating lower bounds when using Karmarkar's projective algorithm for linear programming