Recovering an Optimal LP Basis from an Interior Point Solution

Simple item page
dc.contributor.authorBixby, Robert E.en_US
dc.contributor.authorSaltzman, Matthew J.en_US
dc.date.accessioned2018-06-18T17:30:47Zen_US
dc.date.available2018-06-18T17:30:47Zen_US
dc.date.issued1991-10en_US
dc.date.noteOctober 1991en_US
dc.description.abstractAn important issue in the implementation of interior point algorithms for linear programming is the recovery of an optimal basic solution from an optimal interior point solution. In this paper we describe a method for recovering such a solution. Our implementation links a high-performance interior point code (OB1) with a high-performance simplex code (CPLEX). Results for our computational tests indicate that basis recovery can be done quickly and efficiently.en_US
dc.format.extent31 ppen_US
dc.identifier.citationBixby, Robert E. and Saltzman, Matthew J.. "Recovering an Optimal LP Basis from an Interior Point Solution." (1991) <a href="https://hdl.handle.net/1911/101733">https://hdl.handle.net/1911/101733</a>.en_US
dc.identifier.digitalTR91-32en_US
dc.identifier.urihttps://hdl.handle.net/1911/101733en_US
dc.language.isoengen_US
dc.titleRecovering an Optimal LP Basis from an Interior Point Solutionen_US
dc.typeTechnical reporten_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR91-32.pdf
Size:
358.07 KB
Format:
Adobe Portable Document Format
Download
Collections
CMOR Technical Reports