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 FieldValueLanguage
dc.contributorFreund, Robert M.-
dc.contributorMassachusetts Institute of Technology. Operations Research Center-
dc.date2004-05-28T19:29:49Z-
dc.date2004-05-28T19:29:49Z-
dc.date1987-
dc.date.accessioned2013-10-09T02:38:36Z-
dc.date.available2013-10-09T02:38:36Z-
dc.date.issued2013-10-09-
dc.identifierOR 166-87-
dc.identifierhttp://hdl.handle.net/1721.1/5244-
dc.identifier.urihttp://koha.mediu.edu.my:8181/xmlui/handle/1721-
dc.descriptionby Robert M. Freund.-
dc.descriptionAlso issued as: Working Paper (Sloan School of Management) ; WP 1921-87.-
dc.descriptionIncludes bibliographical references (leaf 12).-
dc.descriptionSupported in part by ONR N00014-87-K-0212-
dc.format12 leaves-
dc.format702851 bytes-
dc.formatapplication/pdf-
dc.languageeng-
dc.publisherMassachusetts Institute of Technology, Operations Research Center-
dc.relationWorking paper (Massachusetts Institute of Technology. Operations Research Center) ; OR 166-87. Working paper (Sloan School of Management) ; 1921-87.-
dc.subjectQ175.M41 O616 no.166-87-
dc.titleAn 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.