Show simple item record

dc.contributor.authorBixby, Robert E.
dc.date.accessioned 2018-06-18T17:41:11Z
dc.date.available 2018-06-18T17:41:11Z
dc.date.issued 1993-09
dc.identifier.citation Bixby, Robert E.. "Progress in Linear Programming." (1993) https://hdl.handle.net/1911/101811.
dc.identifier.urihttps://hdl.handle.net/1911/101811
dc.description.abstract There 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.extent 20 pp
dc.title Progress in Linear Programming
dc.type Technical report
dc.date.note September 1993 (Revised October 1993)
dc.identifier.digital TR93-40
dc.type.dcmi Text


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record