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

Description

Robert M. Freund. / Includes bibliographical references. / Supported in part by the MIT-NTU Collaboration Agreement.

Links & Downloads

1. WP#3559-93-MSA
2. http://hdl.handle.net/1721.1/2465

Tags

HD28 .M414 no.3559-, 93

Additional Fields

Identifer	oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/2465
Date	January 1993
Contributors	Freund, Robert Michael.
Publisher	Alfred P. Sloan School of Management, Massachusetts Institute of Technology
Source Sets	M.I.T. Theses and Dissertation
Language	English
Detected Language	English
Format	42 p., 1801320 bytes, application/pdf
Relation	Working paper (Sloan School of Management) ; 3559-93.