MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Operations Research Center
  • Operations Research Center Working Papers
  • View Item
  • DSpace@MIT Home
  • Operations Research Center
  • Operations Research Center Working Papers
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

Author(s)
Freund, Robert M.; Massachusetts Institute of Technology. Operations Research Center
Thumbnail
DownloadOR-166-87-24445919.pdf (686.3Kb)
Metadata
Show full item record
Description
Also issued as: Working Paper (Sloan School of Management) ; WP 1921-87.
 
Includes bibliographical references (leaf 12).
 
Date issued
1987
URI
http://hdl.handle.net/1721.1/5244
Publisher
Massachusetts Institute of Technology, Operations Research Center
Other identifiers
OR 166-87
Series/Report no.
Working paper (Massachusetts Institute of Technology. Operations Research Center) ; OR 166-87. Working paper (Sloan School of Management) ; 1921-87.

Collections
  • Operations Research Center Working Papers

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.