Performance results of the simplex algorithm for a set of real-world linear programming models

Authors:
Edward H. McCall
Affiliations:
Sperry Univac, St. Paul and Univ. of Minnesota, Minneapolis
Venue:
Communications of the ACM
Year:
1982

Citing 0
Cited 3

Undebuggability and cognitive science

Communications of the ACM
Resource Sharing Interconnection Networks in Multiprocessors

IEEE Transactions on Computers
Reducing channel density in standard cell layout

DAC '83 Proceedings of the 20th Design Automation Conference

Quantified Score

Hi-index	48.24

Visualization

Abstract

This paper provides performance results using the SPERRY UNIVAC 1100 Series linear programming product FMPS to solve a set of 16 real-world linear programming problems. As such, this paper provides a data point for the actual performance of a commercial simplex algorithm on real-world linear programming problems and shows that the simplex algorithm is a linear time algorithm in actual performance. Correlations and performance relationships not previously available are also provided.