An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution

An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution

Includes bibliographical references.

Bibliographic Details
Other Authors: Freund, Robert Michael.
Language:eng
Published: Alfred P. Sloan School of Management, Massachusetts Institute of Technology 2003
Subjects:
HD28 .M414 no.3559-, 93
Online Access:http://hdl.handle.net/1721.1/2465

Similar Items

Similar Items