Following a "balanced" trajectory from an infeasible point to an optimal linear programming solution with a polynomial-time algorithm
Includes bibliographical references.
| Other Authors: | |
|---|---|
| Language: | eng |
| Published: |
Alfred P. Sloan School of Management, Massachusetts Institute of Technology, 1992.
2003
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/2428 |
| _version_ | 1826193614604075008 |
|---|---|
| author2 | Freund, Robert Michael. |
| author_facet | Freund, Robert Michael. |
| collection | MIT |
| description | Includes bibliographical references. |
| first_indexed | 2024-09-23T09:41:57Z |
| id | mit-1721.1/2428 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T09:41:57Z |
| publishDate | 2003 |
| publisher | Alfred P. Sloan School of Management, Massachusetts Institute of Technology, 1992. |
| record_format | dspace |
| spelling | mit-1721.1/24282019-04-12T08:21:49Z Following a "balanced" trajectory from an infeasible point to an optimal linear programming solution with a polynomial-time algorithm Freund, Robert Michael. HD28 .M414 no.3453-, 92 Includes bibliographical references. Supported by NSF, AFOSR and ONR through NSF grant. DMS-8920550 Supported by the MIT-NTU Collaboration Research Fund. Robert M. Freund. 2003-04-29T05:07:19Z 2003-04-29T05:07:19Z 2003-04-29T05:07:19Z #3453-92-MSA http://hdl.handle.net/1721.1/2428 eng Working paper (Sloan School of Management) ; 3453-92. 1 v. (various pagings) 1747502 bytes application/pdf application/pdf Alfred P. Sloan School of Management, Massachusetts Institute of Technology, 1992. |
| spellingShingle | HD28 .M414 no.3453-, 92 Following a "balanced" trajectory from an infeasible point to an optimal linear programming solution with a polynomial-time algorithm |
| title | Following a "balanced" trajectory from an infeasible point to an optimal linear programming solution with a polynomial-time algorithm |
| title_full | Following a "balanced" trajectory from an infeasible point to an optimal linear programming solution with a polynomial-time algorithm |
| title_fullStr | Following a "balanced" trajectory from an infeasible point to an optimal linear programming solution with a polynomial-time algorithm |
| title_full_unstemmed | Following a "balanced" trajectory from an infeasible point to an optimal linear programming solution with a polynomial-time algorithm |
| title_short | Following a "balanced" trajectory from an infeasible point to an optimal linear programming solution with a polynomial-time algorithm |
| title_sort | following a balanced trajectory from an infeasible point to an optimal linear programming solution with a polynomial time algorithm |
| topic | HD28 .M414 no.3453-, 92 |
| url | http://hdl.handle.net/1721.1/2428 |