Following a "balanced" trajectory from an infeasible point to an optimal linear programming solution with a polynomial-time algorithm

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/2428

Full metadata record

DC Field	Value	Language
dc.contributor	Freund, Robert Michael.	-
dc.date	2003-04-29T05:07:19Z	-
dc.date	2003-04-29T05:07:19Z	-
dc.date	2003-04-29T05:07:19Z	-
dc.date.accessioned	2013-06-01T01:20:10Z	-
dc.date.available	2013-06-01T01:20:10Z	-
dc.date.issued	2013-06-01	-
dc.identifier	#3453-92-MSA	-
dc.identifier	http://hdl.handle.net/1721.1/2428	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/jspui/handle/1721	-
dc.description	Robert M. Freund.	-
dc.description	Includes bibliographical references.	-
dc.description	Supported by NSF, AFOSR and ONR through NSF grant. DMS-8920550 Supported by the MIT-NTU Collaboration Research Fund.	-
dc.format	1 v. (various pagings)	-
dc.format	1747502 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Alfred P. Sloan School of Management, Massachusetts Institute of Technology, 1992.	-
dc.relation	Working paper (Sloan School of Management) ; 3453-92.	-
dc.subject	HD28 .M414 no.3453-, 92	-
dc.title	Following a "balanced" trajectory from an infeasible point to an optimal linear programming solution with a polynomial-time algorithm	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI