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.

An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution

Thumbnail Image
Download
Name

SWP-3559-28226980.pdf

Size

1.72 MB

Format

Adobe PDF

Checksum (MD5)

5af6bf4f0eb8cb24176b10a6af94f578

Date Issued
1993
Publisher
Alfred P. Sloan School of Management, Massachusetts Institute of Technology
Series/Report no.
Working paper (Sloan School of Management) ; 3559-93.
Description
Includes bibliographical references.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.