Short Steps with Karmarkar’s Projective Algorithm for Linear Programming
From MaRDI portal
Publication:4294752
DOI10.1137/0804011zbMath0799.90085OpenAlexW2109514698MaRDI QIDQ4294752
Jean-Philippe Vial, Jean-Louis Goffin
Publication date: 17 November 1994
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0804011
Related Items (2)
A path-following version of the Todd-Burrell procedure for linear programming ⋮ Todd's low-complexity algorithm is a predictor-corrector path-following method
This page was built for publication: Short Steps with Karmarkar’s Projective Algorithm for Linear Programming