A simplex type method using multiple updatings for specially structured linear programs

Many important large-scale linear programs with special structures lead to special computational procedures which are more efficient than the ordinary procedure of the generalized methods. Problems and their solvers taking advantage of multiple updatings of the basis in the dual simplex type method are presented. Computational results run by the efficient algorithm and a standard code MINOS for the test problems are compared and analyzed. It is shown that the amount of work for the optimal solution for the problem can be reduced by the new algorithm.