Abstract
In Chapter 3 it was pointed out that matrix A of the constraints of large scale LP problems is generally very sparse. The columns contain, on the average, 5 – 10 nonzeros independent of the row dimension of the matrix. As a basis B is part of A it has a similar sparsity. Probably the only difference between the sparsity of the two is that A usually has a structure of the nonzeros while in B the columns appear intermixed without any particular structure.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Maros, I. (2003). Data Structures and Basic Operations. In: Computational Techniques of the Simplex Method. International Series in Operations Research & Management Science, vol 61. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0257-9_5
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0257-9_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4990-7
Online ISBN: 978-1-4615-0257-9
eBook Packages: Springer Book Archive