DSpace Repository

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

Show simple item record

dc.contributor Freund, Robert Michael.
dc.date 2003-04-29T05:08:35Z
dc.date 2003-04-29T05:08:35Z
dc.date 1993
dc.date.accessioned 2013-06-04T16:14:37Z
dc.date.available 2013-06-04T16:14:37Z
dc.date.issued 2013-06-05
dc.identifier WP#3559-93-MSA
dc.identifier http://hdl.handle.net/1721.1/2465
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description Robert M. Freund.
dc.description Includes bibliographical references.
dc.description Supported in part by the MIT-NTU Collaboration Agreement.
dc.format 42 p.
dc.format 1801320 bytes
dc.format application/pdf
dc.language eng
dc.publisher Alfred P. Sloan School of Management, Massachusetts Institute of Technology
dc.relation Working paper (Sloan School of Management) ; 3559-93.
dc.subject HD28 .M414 no.3559-, 93
dc.title An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account