Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5244
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor | Freund, Robert M. | - |
dc.contributor | Massachusetts Institute of Technology. Operations Research Center | - |
dc.date | 2004-05-28T19:29:49Z | - |
dc.date | 2004-05-28T19:29:49Z | - |
dc.date | 1987 | - |
dc.date.accessioned | 2013-10-09T02:38:36Z | - |
dc.date.available | 2013-10-09T02:38:36Z | - |
dc.date.issued | 2013-10-09 | - |
dc.identifier | OR 166-87 | - |
dc.identifier | http://hdl.handle.net/1721.1/5244 | - |
dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
dc.description | by Robert M. Freund. | - |
dc.description | Also issued as: Working Paper (Sloan School of Management) ; WP 1921-87. | - |
dc.description | Includes bibliographical references (leaf 12). | - |
dc.description | Supported in part by ONR N00014-87-K-0212 | - |
dc.format | 12 leaves | - |
dc.format | 702851 bytes | - |
dc.format | application/pdf | - |
dc.language | eng | - |
dc.publisher | Massachusetts Institute of Technology, Operations Research Center | - |
dc.relation | Working paper (Massachusetts Institute of Technology. Operations Research Center) ; OR 166-87. Working paper (Sloan School of Management) ; 1921-87. | - |
dc.subject | Q175.M41 O616 no.166-87 | - |
dc.title | An analog of Karmarkar's algorithm for inequality constrained linear programs, with a "new" class of projective transformations for centering a polytope | - |
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.