Progress in Linear Programming

Simple item page
dc.contributor.authorBixby, Robert E.
dc.date.accessioned2018-06-18T17:41:11Z
dc.date.available2018-06-18T17:41:11Z
dc.date.issued1993-09
dc.date.noteSeptember 1993 (Revised October 1993)
dc.description.abstractThere is little doubt that barrier methods are now indispensable tools in the solution of large-scale linear programming problems. However, it is our opinion that the results of Lustig, Marsten and Shanno (hereafter LMS) somewhat overstate the performance of these methods relative to the simplex method. We will present a sightly different view of progress in linear programming, one in which barrier methods do not dominate in the solution of large-scale problems.
dc.format.extent20 pp
dc.identifier.citationBixby, Robert E.. "Progress in Linear Programming." (1993) <a href="https://hdl.handle.net/1911/101811">https://hdl.handle.net/1911/101811</a>.
dc.identifier.digitalTR93-40
dc.identifier.urihttps://hdl.handle.net/1911/101811
dc.language.isoeng
dc.titleProgress in Linear Programming
dc.typeTechnical report
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR93-40.pdf
Size:
287.63 KB
Format:
Adobe Portable Document Format
Download
Collections
CAAM Technical Reports