Abstract
In the last two decades a number of algorithmic units of the simplex method have undergone repeated revisions with a view to improving the computational performance of the simplex based solvers. This research has lead to considerable progress such that the state-of-the-art solvers are approximately two orders of magnitude faster than their predecessors in the’70s.
This project was partly supported by DTI industrial research contract No. IED3/45/91/021.
This author was supported in part by Hungarian Research Fund OTKA 2587.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bixby, R. E., “Implementing the Simplex Method: The Initial Basis”, ORS A Journal on Computing, Vol. 4, No. 3, Summer, 1992, p. 267–284.
Carstens, D.M., “Crashing Techniques”, in: Orchard-Hays, W., Advanced Linear-Programming Computing Techniques, McGraw-Hill, 1968, pp. 131–139.
Ellison, E. F. D., Hajian, M., Levkovitz, R., Maros, L, Mitra, G., Sayers, D., FortMP Manual, Brunel, The University of West London, and NAG Ltd., Oxford, May 1994.
Gay, D.M., “Electronic mail distribution of linear programming test problems”, Mathematical Programming Society COAL Newsletter, 13(1985), p. 10–12.
Gould, N.I.M., Reid, J.K., “New crash procedures for large systems of linear constraints”, Mathematical Programming, 45 (1989), p. 475–501.
Maros, I., “MILP Linear Programming System, User’s Guide for Version V3.40”, Computer and Automation Institute (MTA SZTAKI), Budapest, Hungary, January, 1990.
Maros, I., Mitra, G., “Simplex Algorithms”, TR/12/95, Department of Mathematics and Statistics, Brunel University, West London, June 1995
also to appear as a chapter in J. Beasley (Ed.), Advances in Linear and Integer Programming, Oxford University Press.
Murtagh, B.A., Saunders, M., “MINOS 5.1 User’s Guide”, Technical Report, SOL 83–20R, Stanford University, Stanford, California, 1987.
Orchard-Hays, W., Advanced Linear-Programming Computing Techniques, McGraw-Hill, 1968.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maros, I., Mitra, G. (1996). Finding Better Starting Bases for the Simplex Method. In: Kleinschmidt, P., Bachem, A., Derigs, U., Fischer, D., Leopold-Wildburger, U., Möhring, R. (eds) Operations Research Proceedings 1995. Operations Research Proceedings, vol 1995. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80117-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-80117-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60806-6
Online ISBN: 978-3-642-80117-4
eBook Packages: Springer Book Archive