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.
Thumbnail
DownloadSWP-3559-28226980.pdf (1.717Mb)
Metadata
Show full item record
Description
Includes bibliographical references.
Date issued
1993
URI
http://hdl.handle.net/1721.1/2465
Publisher
Alfred P. Sloan School of Management, Massachusetts Institute of Technology
Other identifiers
WP#3559-93-MSA
Series/Report no.
Working paper (Sloan School of Management) ; 3559-93.
Collections