An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
Author(s)Freund, Robert Michael.
Includes bibliographical references.
Alfred P. Sloan School of Management, Massachusetts Institute of Technology
Working paper (Sloan School of Management) ; 3559-93.