An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
Includes bibliographical references.
Other Authors: | |
---|---|
Language: | eng |
Published: |
Alfred P. Sloan School of Management, Massachusetts Institute of Technology
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/2465 |