A relaxed version of Karmarkar's method

Donald Goldfarb; Sanjay Mehrotra

doi:10.1007/BF01580737

A relaxed version of Karmarkar's method

Donald Goldfarb^*, Sanjay Mehrotra

^*Corresponding author for this work

Industrial Engineering and Management Sciences

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

Abstract

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 language	English (US)
Pages (from-to)	289-315
Number of pages	27
Journal	Mathematical Programming
Volume	40
Issue number	1-3
DOIs	https://doi.org/10.1007/BF01580737
State	Published - Jan 1988

Keywords

Karmarkar's method
Linear programming
inexact projections

ASJC Scopus subject areas

Software
General Mathematics

Access to Document

10.1007/BF01580737

Cite this

@article{c57756896f74487c9e39cfb1a2b8c682,

title = "A relaxed version of Karmarkar's method",

abstract = "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.",

keywords = "Karmarkar's method, Linear programming, inexact projections",

author = "Donald Goldfarb and Sanjay Mehrotra",

year = "1988",

month = jan,

doi = "10.1007/BF01580737",

language = "English (US)",

volume = "40",

pages = "289--315",

journal = "Mathematical Programming",

issn = "0025-5610",

publisher = "Springer-Verlag GmbH and Co. KG",

number = "1-3",

}

TY - JOUR

T1 - A relaxed version of Karmarkar's method

AU - Goldfarb, Donald

AU - Mehrotra, Sanjay

PY - 1988/1

Y1 - 1988/1

N2 - 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.

AB - 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.

KW - Karmarkar's method

KW - Linear programming

KW - inexact projections

UR - http://www.scopus.com/inward/record.url?scp=34250094734&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34250094734&partnerID=8YFLogxK

U2 - 10.1007/BF01580737

DO - 10.1007/BF01580737

M3 - Article

AN - SCOPUS:34250094734

SN - 0025-5610

VL - 40

SP - 289

EP - 315

JO - Mathematical Programming

JF - Mathematical Programming

IS - 1-3

ER -

A relaxed version of Karmarkar's method

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this