Sparse Matrix Techniques in Two Mathematical Programming Codes

The authors empirically compared ten pivot selection rules for representing the inverse of a sparse basis in triangularized product form. On examples drawn from actual applications, one of the rules yield inverses that were only slightly less sparse than the original basis. The rule was used in the M5 mathematical programming system and has resulted in substantial reduction in running time.