Library

eCommons

 

A Lower Bound on the Number of Iterations of Primal-Dual Interior-Point Methods for Linear Programming

Simple item page
dc.contributor.authorTodd, M. J.en_US
dc.date.accessioned2007-11-09T20:12:33Z
dc.date.available2007-11-09T20:12:33Z
dc.date.issued1993-03en_US
dc.description.abstractA Lower Bound on the Number of Iterations of Primal-Dual Interior-Point Methods for Linear Programmingen_US
dc.format.extent3060362 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.citation1050en_US
dc.identifier.urihttps://hdl.handle.net/1813/8934
dc.language.isoen_USen_US
dc.publisherCornell University Operations Research and Industrial Engineeringen_US
dc.subjectOperations Researchen_US
dc.subjectIndustrial Engineeringen_US
dc.subjecttechnical reporten_US
dc.titleA Lower Bound on the Number of Iterations of Primal-Dual Interior-Point Methods for Linear Programmingen_US
dc.typetechnical reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR001050.pdf
Size:
2.92 MB
Format:
Adobe Portable Document Format
Download

Collections

ORIE Technical Reports