Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Operations Research Center
  3. Operations Research Center Working Papers
  4. On the worst case complexity of potential reduction algorithms for linear programming

On the worst case complexity of potential reduction algorithms for linear programming

Thumbnail Image
Download
Name

OR-279-93-28226978.pdf

Size

1.42 MB

Format

Adobe PDF

Checksum (MD5)

2bbd32edb6ebafc7b4f3e597529cc1ff

Date Issued
1993
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 279-93
Description
Includes bibliographical references (p. 16-17).
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
http://hdl.handle.net/1721.1/5130
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.