An experimental approach to karmarkar’s projective method for linear programming
From MaRDI portal
Publication:3773690
DOI10.1007/BFb0121187zbMath0634.90044OpenAlexW61120940MaRDI QIDQ3773690
No author found.
Publication date: 1987
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0121187
sparse matricessimplex methodcomputational resultslinear least squaresexperimental implementationKarmarkar projective method
Related Items
A new variant of the primal affine scaling algorithm for linear programs, Convergence results and numerical experiments on a linear programming hybrid algorithm, Implementing an affine scaling algorithm for linear programming, Karmarkar's projective algorithm: A null space variant for multi- commodity generalized networks, Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value, Computing Karmarkar projections quickly, A relaxed version of Karmarkar's method, Some remarks on Karmarkar's potential function, Karmarkar's projective method for linear programming: a computational survey, A variant of Karmarkar's linear programming algorithm for problems in standard form, A variable-metric variant of the Karmarkar algorithm for linear programming, On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method, El metodo de Karmarkar: Un estudio de sus variantes, An implementation of Karmarkar's algorithm for linear programming, A parallel interior point algorithm for linear programming on a network of transputers
