Show simple item record

An analog of Karmarkar's algorithm for inequality constrained linear programs, with a "new" class of projective transformations for centering a polytope

dc.contributorFreund, Robert M.en_US
dc.contributorMassachusetts Institute of Technology. Operations Research Centeren_US
dc.date.accessioned2004-05-28T19:29:49Z
dc.date.available2004-05-28T19:29:49Z
dc.date.issued1987en_US
dc.identifier.otherOR 166-87en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/5244
dc.descriptionAlso issued as: Working Paper (Sloan School of Management) ; WP 1921-87.en_US
dc.descriptionIncludes bibliographical references (leaf 12).en_US
dc.description.sponsorshipSupported in part by ONR N00014-87-K-0212en_US
dc.description.statementofresponsibilityby Robert M. Freund.en_US
dc.format.extent12 leavesen_US
dc.format.extent702851 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technology, Operations Research Centeren_US
dc.relation.ispartofseriesWorking paper (Massachusetts Institute of Technology. Operations Research Center) ; OR 166-87. Working paper (Sloan School of Management) ; 1921-87.en_US
dc.subject.lccQ175.M41 O616 no.166-87en_US
dc.titleAn analog of Karmarkar's algorithm for inequality constrained linear programs, with a "new" class of projective transformations for centering a polytopeen_US
dc.typeWorking Paper
dc.contributor.departmentMassachusetts Institute of Technology. Operations Research Center


Files in this item

Thumbnail
Name:
OR-166-87-24445919.pdf
Size:
686.3Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record