Abstract
As mentioned above, three different codes of the simplex method were used. In each of them the number of operations of the type described by equation (9) was counted. Furthermore, the number of non-zero elements of the “working coefficient matrix” was recorded. By “working coefficient matrix” shall be understood:
-
(1)
The current m x n coefficient matrix in the normal simplex method (Program 1),
-
(2)
The current inverse (in explicit form) of the basis, (including the right hand side vector and the vector of the simplex multipliers) in program 2,
-
(3)
The current inverse (in symmetric product form; no reinversion) of the basis in program 3.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
The current m x n coefficient matrix in the normal simplex method (Program 1)
The current inverse (in explicit form) of the basis, (including the right hand side vector and the vector of the simplex multipliers) in program 2
The current inverse (in symmetric product form; no reinversion) of the basis in program 3.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1970 Springer-Verlag Berlin · Heidelberg
About this chapter
Cite this chapter
Müller-Merbach, H. (1970). The Programs. In: On Round-Off Errors in Linear Programming. Lecture Notes in Operations Research and Mathematical Systems, vol 37. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95167-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-95167-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-04960-9
Online ISBN: 978-3-642-95167-1
eBook Packages: Springer Book Archive