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

Includes bibliographical references (p. 16-17).

Bibliographic Details
Other Authors:	Bertsimas, Dimitris J.
Language:	eng
Published:	Massachusetts Institute of Technology, Operations Research Center 2004
Online Access:	http://hdl.handle.net/1721.1/5130

Internet

http://hdl.handle.net/1721.1/5130