Invited Note---Some References for the Ellipsoid Algorithm

Philip Wolfe
Additional contact information
Philip Wolfe: IBM Research Center, Yorktown Heights

Management Science, 1980, vol. 26, issue 8, 747-749

Abstract: From personal interest and also on behalf of the Mathematical Programming Society I have been trying to keep afloat in the flood of writing that followed Khachian's "Polynomial Time Algorithm for Linear Programming" (Khachian, L. G. 1979. A polynomial algorithm in linear programming. Dokl. Akad. Nauk SSSR 244 (5) 1093--1096; 1979. Soviet Math. Dokl. 20 191--194.)---or, more precisely, that followed the article "A Soviet discovery rocks world of mathematics" on the front page of the New York Times for November 7, 1979; 41 of the 44 post-Khachian papers I have seen are dated November, 1979 or later. (They are listed and briefly annotated in the bibliography (Wolfe, P. 1980. A bibliography for the ellipsoid algorithm. (29 April) 6.), along with relevant background items and some 30 press reports, etc.) The present note, portions of which are taken from an article to appear in the first issue of Optima, Newsletter of the Mathematical Programming Society, points to a few items of this considerably overlapping literature which may be of use to the curious reader.

Keywords: computational complexity; linear programming algorithms (search for similar items in EconPapers)
Date: 1980
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.26.8.747 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:26:y:1980:i:8:p:747-749

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().