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

dc.contributor	Freund, Robert M.	en_US
dc.contributor	Massachusetts Institute of Technology. Operations Research Center	en_US
dc.date.accessioned	2004-05-28T19:29:49Z
dc.date.available	2004-05-28T19:29:49Z
dc.date.issued	1987	en_US
dc.identifier.other	OR 166-87	en_US
dc.identifier.uri	http://hdl.handle.net/1721.1/5244
dc.description	Also issued as: Working Paper (Sloan School of Management) ; WP 1921-87.	en_US
dc.description	Includes bibliographical references (leaf 12).	en_US
dc.description.sponsorship	Supported in part by ONR N00014-87-K-0212	en_US
dc.description.statementofresponsibility	by Robert M. Freund.	en_US
dc.format.extent	12 leaves	en_US
dc.format.extent	702851 bytes
dc.format.mimetype	application/pdf
dc.language.iso	eng	en_US
dc.publisher	Massachusetts Institute of Technology, Operations Research Center	en_US
dc.relation.ispartofseries	Working paper (Massachusetts Institute of Technology. Operations Research Center) ; OR 166-87. Working paper (Sloan School of Management) ; 1921-87.	en_US
dc.subject.lcc	Q175.M41 O616 no.166-87	en_US
dc.title	An analog of Karmarkar's algorithm for inequality constrained linear programs, with a "new" class of projective transformations for centering a polytope	en_US