Reoptimization procedures for bounded variable primal simplex network algorithms

Many algorithms and applications call for the use of a network subprogram which must be optimized numerous times with slight changes to the problem data. Bound and right-hand-side changes to an existing basis tree may yield an infeasible basic solution. This report gives a sequence of steps that modify an existing basic solution to reflect such changes and streamline the reoptimization process.