Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/2465| Title: | An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution |
| Authors: | Freund, Robert Michael. |
| Keywords: | HD28 .M414 no.3559-, 93 |
| Issue Date: | 5-Jun-2013 |
| Publisher: | Alfred P. Sloan School of Management, Massachusetts Institute of Technology |
| Description: | Robert M. Freund. Includes bibliographical references. Supported in part by the MIT-NTU Collaboration Agreement. |
| URI: | http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
| Other Identifiers: | WP#3559-93-MSA http://hdl.handle.net/1721.1/2465 |
| Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.