Karmarkar: a new polynomial-time algorithm for linear programming

What changed

Gave a projective interior-point algorithm with polynomial worst-case convergence.

Scientific scope

The record is Karmarkar's sole-author 1984 Combinatorica paper. It does not claim the first polynomial-time linear-programming algorithm, absorb the ellipsoid method or represent every later interior-point implementation and complexity refinement.

Evidence

The linked sources identify this contribution and its scope. WRS has not independently reconstructed the scientific claims. The record is Karmarkar's sole-author 1984 Combinatorica paper. It does not claim the first polynomial-time linear-programming algorithm, absorb the ellipsoid method or represent every later interior-point implementation and complexity refinement.

Contributors

• Narendra Karmarkar · SCIENCE: Named source author of the scoped work; individual effort shares are not measured.

• Springer DOI for Karmarkar algorithm
• University-hosted copy of Karmarkar paper

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction