Bixby, Robert E.Saltzman, Matthew J.2018-06-182018-06-181991-10Bixby, 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>.https://hdl.handle.net/1911/101733An 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.31 ppengTechnical reportTR91-32