The proportion of the coefficients of a constraint matrix that are nonzero. For a given (m × n) matrix A = (a ij), if k is the number of nonzero a ij, then the density is given by k/(m × n). Most large-scale linear-programming problems have a low density of the order of 0.01. Sparse matrix; Super sparsity.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). Density . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_230
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_230
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive