A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start'' (Q1181909)

This paper develops an algorithm for solving a standard-form linear program directly from an infeasible ``warm start''. The algorithm is a potential function reduction algorithm. The paper is partially motivated by the following phenomenon related to the simplex methods: The optimal basis of one version of the model usually serves as an excellent starting basis for the next version of the model, whether or not the basis is even feasible for the next version of the model.