Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Operations Research Center
  3. Operations Research Center Working Papers
  4. An analog of Karmarkar's algorithm for inequality constrained linear programs, with a "new" class of projective transformations for centering a polytope

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

Thumbnail Image
Download
Name

OR-166-87-24445919.pdf

Size

686.38 KB

Format

Adobe PDF

Checksum (MD5)

477cd647e3976052e5e56f94f2c9e994

Date Issued
1987
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Working paper (Massachusetts Institute of Technology. Operations Research Center) ; OR 166-87. Working paper (Sloan School of Management) ; 1921-87.
Description
Also issued as: Working Paper (Sloan School of Management) ; WP 1921-87.
Includes bibliographical references (leaf 12).
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
http://hdl.handle.net/1721.1/5244
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.