Parameter α versus number of iterations in Karmarkar's algorithm for LP

Authors:
Syamal K. Sen;Juan F. Avila
Affiliations:
Department of Mathematical Sciences, Florida Institute of Technology, Melbourne, FL;Department of Mathematical Sciences, Florida Institute of Technology, Melbourne, FL
Venue:
Neural, Parallel & Scientific Computations
Year:
2010

Citing 4
Cited 0

A new polynomial-time algorithm for linear programming

Combinatorica
A variation on Karmarkar's algorithm for solving linear programming problems

Mathematical Programming: Series A and B
Linear programming and network flows (2nd ed.)

Linear programming and network flows (2nd ed.)
Solving linear programming problems exactly

Applied Mathematics and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Karmarkar's projective transformation algorithm for solving a linear program (LP) is the first polynomial time algorithm which was published in 1984. This algorithm implemented in Mathematica in this article has used a real parameter 0