Return to search

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

Dimitris Bertsimas and Xiaodong Luo. / Includes bibliographical references (p. 16-17). / Supported by a Presidential Young Investigator Award. DDM-9158118 Supported by Draper Laboratory.

Identiferoai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/2464
Date January 1993
ContributorsBertsimas, Dimitris., Luo, Xiaodong.
PublisherAlfred P. Sloan School of Management, Massachusetts Institute of Technology
Source SetsM.I.T. Theses and Dissertation
LanguageEnglish
Detected LanguageEnglish
Format17 p., 905583 bytes, application/pdf
RelationWorking paper (Sloan School of Management) ; 3558-93.

Page generated in 0.0021 seconds