Abstract

There is little doubt that barrier methods are now indispensable tools in the solution of large-scale linear programming problems. However, it is our opinion that the results of Lustig, Marsten, and Shanno (hereafter LMS) somewhat overstate the performance of these methods relative to the simplex method. We will present a slightly different view of progress in linear programming, one in which barrier methods do not dominate in the solution of large-scale problems. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.

Keywords

Linear programmingSimplex algorithmComputer scienceScale (ratio)Mathematical optimizationOperations researchMathematicsAlgorithm

Affiliated Institutions

Related Publications

Publication Info

Year
1994
Type
article
Volume
6
Issue
1
Pages
15-22
Citations
87
Access
Closed

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

87
OpenAlex
1
Influential
86
CrossRef

Cite This

Robert E. Bixby (1994). Commentary—Progress in Linear Programming. INFORMS Journal on Computing , 6 (1) , 15-22. https://doi.org/10.1287/ijoc.6.1.15

Identifiers

DOI
10.1287/ijoc.6.1.15

Data Quality

Data completeness: 81%