A Variant of Karmarkar’s Linear Programming Algorithm for Problems with Some Unrestricted Variables
DOI10.1137/0610003zbMATH Open0667.65048OpenAlexW2041499478MaRDI QIDQ3819909FDOQ3819909
Authors: 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
Recommendations
- A variant of Karmarkar's linear programming algorithm for problems in standard form
- Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
- A variation on Karmarkar’s algorithm for solving linear programming problems
- scientific article; zbMATH DE number 4170639
- scientific article; zbMATH DE number 969963
Karmarkar's algorithmunrestricted variablesconstrained least squares problemprojective linear programming algorithm
Numerical mathematical programming methods (65K05) Computational methods for sparse matrices (65F50) Linear programming (90C05)
Cited In (9)
- Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
- Unrestricted variables in linear programming
- On motivating the Mitchell-Todd modification of Karmarkar's algorithm for LP problems with free variables
- A variant of Karmarkar's linear programming algorithm for problems in standard form
- Updating lower bounds when using Karmarkar's projective algorithm for linear programming
- Solving combinatorial optimization problems using Karmarkar's algorithm
- On the solution of linear programming problems with free (unrestricted) variables
- The simplex method and unrestricted variables
- The affine-scaling direction for linear programming is a limit of projective-scaling directions
This page was built for publication: A Variant of Karmarkar’s Linear Programming Algorithm for Problems with Some Unrestricted Variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3819909)
