Library

eCommons

 

Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm

Simple item page
dc.contributor.authorTodd, M.en_US
dc.date.accessioned2007-11-09T19:13:03Z
dc.date.available2007-11-09T19:13:03Z
dc.date.issued1986-10en_US
dc.description.abstractImproved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithmen_US
dc.format.extent1669267 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.citation721en_US
dc.identifier.urihttps://hdl.handle.net/1813/8604
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.titleImproved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithmen_US
dc.typetechnical reporten_US

Files

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

Collections

ORIE Technical Reports