Abstract
The purpose of this paper is to show how Harris’ TREAD value can be computed without approximation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.J.H. Forrest and J.A. Tomlin, “Updating triangular factors of the basis to maintain sparsity in the product form simplex method”, Mathematical Programming 2 (1972) 263–278.
P.M.J. Harris, “Pivot selection methods of the Devex LP code”, Mathematical Programming Study 4 (1975) 30–57 (this volume).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 The Mathematical Programming Society
About this chapter
Cite this chapter
Greenberg, H.J., Kalan, J.E. (1975). An exact update for Harris’ TREAD. In: Balinski, M.L., Hellerman, E. (eds) Computational Practice in Mathematical Programming. Mathematical Programming Studies, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120709
Download citation
DOI: https://doi.org/10.1007/BFb0120709
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00765-1
Online ISBN: 978-3-642-00766-8
eBook Packages: Springer Book Archive