Suchergebnisse

AbstractThis exposition presents a method for incorporating a technique known as "splitting the bump" within an elimination form reinversion algorithm. This procedure is designed to reduce fill‐in during reinversion and should improve the efficiency of linear programming systems which already use the superior elimination form of the inverse.

AbstractDuring basis reinversion of either a product form or elimination form linear programming system, it may become necessary to swap spike columns to effect the reinversion and maintain the desired sparsity characteristics. This note shows that the only spikes which need be examined when an interchange is required are those not yet processed in the current external bump.