A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Encyclopedia of Operations Research and Management Science
Partitioned preassigned pivot procedure. A procedure for arranging the basis matrix of a linear-programming problem into as near a lower triangular form as possible. Such an arrangement helps in maintaining a sparse inverse, given that the original data set for the associated linear-programming problem is sparse.doi:10.1007/978-1-4419-1153-7_200569 fatcat:aqo3msrrzree3aiyv36fsh3afe