The fraction of zeroes in a matrix. If A is m by n, and A(i, j) not= 0 for k of its elements, its sparsity is k/mn. Large linear programs tend to be very sparse, increasing as the dimensions get large. For example, consider the standard transportation problem with s sources and d destinations. This has m = (s+d) constraints and n = sd variables. E.... Found on http://glossary.computing.society.informs.org/index.php?page=S.html