Letter to the Editor—An Approach to Some Structured Linear Programming Problems

A recent paper by J. M. Bennett describes a decomposition algorithm for the class of linear programming problems commonly called “angular systems.” This note draws attention to a variant of the algorithm that is particularly suited to problems in which certain submatrices are sparse.