We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

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
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.