An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
Includes bibliographical references.
| Other Authors: | |
|---|---|
| Language: | eng |
| Published: |
Alfred P. Sloan School of Management, Massachusetts Institute of Technology
2003
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/2465 |
| _version_ | 1826194032193175552 |
|---|---|
| author2 | Freund, Robert Michael. |
| author_facet | Freund, Robert Michael. |
| collection | MIT |
| description | Includes bibliographical references. |
| first_indexed | 2024-09-23T09:49:27Z |
| id | mit-1721.1/2465 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T09:49:27Z |
| publishDate | 2003 |
| publisher | Alfred P. Sloan School of Management, Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/24652019-04-12T07:58:19Z An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution Freund, Robert Michael. HD28 .M414 no.3559-, 93 Includes bibliographical references. Supported in part by the MIT-NTU Collaboration Agreement. Robert M. Freund. 2003-04-29T05:08:35Z 2003-04-29T05:08:35Z 1993 WP#3559-93-MSA http://hdl.handle.net/1721.1/2465 eng Working paper (Sloan School of Management) ; 3559-93. 42 p. 1801320 bytes application/pdf application/pdf Alfred P. Sloan School of Management, Massachusetts Institute of Technology |
| spellingShingle | HD28 .M414 no.3559-, 93 An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution |
| title | An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution |
| title_full | An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution |
| title_fullStr | An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution |
| title_full_unstemmed | An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution |
| title_short | An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution |
| title_sort | infeasible start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution |
| topic | HD28 .M414 no.3559-, 93 |
| url | http://hdl.handle.net/1721.1/2465 |