The Basis Suppression method

The Basis Suppression algorithm is a simplex-based procedure which allows the efficient extension of current special structure algorithms to problems of special structure except for a single complicating side variable. A basis free of the complicating variable is maintained in this algorithm. Various properties of the algorithm are presented, including a proof of convergence. Computational effectiveness is discussed and has been verified by using the procedure to solve the maximal concurrent flow problem.