Karmarkar's projective method for linear programming: A computational appraisal

Karmarkar's projective method for linear programming: A computational appraisal

Interest in linear programming has recently been intensified by the publication and discussion of a projective method algorithm that is not only polynomial in complexity, but is also claimed by its inventor (N. Karmarkar) to be 50–100 times faster than the simplex method. This paper provides a surve...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & industrial engineering 1989, Vol.16 (1), p.189-206
Hauptverfasser: Dodani, Mahesh H., Babu, A.J.G.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Applied sciences
Computer based modeling
Exact sciences and technology
Linear programming
Mathematical analysis
Mathematical programming
Operational research and scientific management
Operational research. Management science
Operations research
Simplex method
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Interest in linear programming has recently been intensified by the publication and discussion of a projective method algorithm that is not only polynomial in complexity, but is also claimed by its inventor (N. Karmarkar) to be 50–100 times faster than the simplex method. This paper provides a survey of interior methods, with special emphasis on the projective method from a computational viewpoint.
ISSN:0360-8352
1879-0550
DOI:10.1016/0360-8352(89)90021-1