A relaxed version of Karmarkar's method

Donald Goldfarb*, Sanjay Mehrotra

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


A relaxed version of Karmarkar's method is developed. This method is proved to have the same polynomial time complexity as Karmarkar's method and its efficient implementation using inexact projections is discussed. Computational results obtained using a preliminary implementation of the method are presented which indicate that the method is practicable.

Original languageEnglish (US)
Pages (from-to)289-315
Number of pages27
JournalMathematical Programming
Issue number1-3
StatePublished - Jan 1988


  • Karmarkar's method
  • Linear programming
  • inexact projections

ASJC Scopus subject areas

  • Software
  • General Mathematics


Dive into the research topics of 'A relaxed version of Karmarkar's method'. Together they form a unique fingerprint.

Cite this