On Exploiting Problem Structure in a Basis Identification Procedure for Linear Programming

References

• Andersen E. D., Andersen K. D. Presolving in linear programming. Math. Programming (1995) 71:221–245Crossref, Google Scholar
• Andersen E. D., Andersen K. D. A parallel interior-point based linear programming solver for shared-memory multiprocessor computers: A case study based on the XPRESS LP solver. (1997) . Technical report, CORE, UCL, BelgiumGoogle Scholar
• Andersen E. D., Andersen K. D., Frenk J. B. G., Roos C., Terlaky T., Zhang S. The MOSEK interior point optimizer for linear programming: An implementation of the homogeneous algorithm. High Performance Optimization Techniques, Proc. HPOPT-II Conf. (1997) . In pressGoogle Scholar
• Andersen E. D., Gondzio J., Mészáros C., Xu X., Terlaky T. Implementation of interior point methods for large scale linear programming. Interior-Point Methods of Mathematical Programming (1996) (Kluwer Academic Publishers)189–252Crossref, Google Scholar
• Andersen E. D., Ye Y. Combining interior-point and pivoting algorithms. Management Sci. (1996) 42:1719–1731Link, Google Scholar
• Bixby R. E. Progress in linear programming. ORSA J. Comput. (1994) 6:15–22Link, Google Scholar
• Bixby R. E., Martin A. Parallelizing the dual simplex method. (1995) . Technical report SC-95-45, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Heilbronner Str. 10, D-10711 Berlin-Wilmersdorf, GermanyGoogle Scholar
• Bixby R. E., Saltzman M. J. Recovering an optimal basis from an interior point solution. Oper. Res. Lett. (1993) 15:169–178Crossref, Google Scholar
• Charnes A., Kortanek K.O. An opposite sign algorithm for purification to an extreme point solution. (1963) . Memorandum No. 89. Office of Naval ResearchGoogle Scholar
• Christiansen E., Kortanek K.O. Computation of the collapse state in limit analysis using the LP primal affine scaling algorithm. J. Comput. Appl. Math. (1991) 34:47–63Crossref, Google Scholar
• Dash AssociatesXPRESS, Release 10 (1997) Google Scholar
• Greenberg H. J. The use of the optimal partition in a linear programming solution for postoptimal analysis. Oper. Res. Lett. (1994) 15:179–186Crossref, Google Scholar
• Kortanek K. O., Zhu J. New purification algorithms for linear programming. Naval Res. Logist. Quart. (1988) 35:571–583Crossref, Google Scholar
• Levkowitz R., Mitra G. Experimental investigations in combining primal dual interior point method and simplex based LP solvers. Ann. Oper. Res. (1995) 58:19–38Crossref, Google Scholar
• Lustig I. J., Marsten R. E., Shanno D. F. Interior point methods for linear programming: Computational state of the art. ORSA J. Comput. (1994) 6:1–15Link, Google Scholar
• Lustig I. J., Rothberg E. Gigaflops in linear programming. Oper. Res. Lett. (1996) 18:157–165Crossref, Google Scholar
• Megiddo N. On finding primal- and dual-optimal bases. ORSA J. Comput. (1991) 3:63–65Link, Google Scholar
• Pothen A., Fan C. Computing the block lower triangular form of a sparse matrix. ACM Trans. Math. Software (1990) 16:303–324Crossref, Google Scholar
• Suhl U. H., Suhl L. M. Computing sparse LU factorizations for large-scale linear programming bases. ORSA J. Comput. (1990) 2:325–335Link, Google Scholar
• Suhl U. H., Suhl L. M. A fast LU update for linear programming. Ann. Oper. Res. (1993) 43:33–47Crossref, Google Scholar
• Ye Y. On the finite convergence of interior-point algorithms for linear programming. Math. Programming (1992) 57:325–335Crossref, Google Scholar