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

DOI10.1287/IJOC.11.1.95zbMATH Open1034.90514OpenAlexW1999349219MaRDI QIDQ4427366FDOQ4427366

Authors E. D. Andersen

Publication date 1999

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/ebfa7dcc02d33bddbeef70487373495b40396065

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• An optimal-basis identification technique for interior-point linear programming algorithms
• Creating advanced bases for large scale linear programs exploiting embedded network structure
• Recovering an optimal LP basis from an interior point solution
• Finding an interior point in the optimal face of linear programs
• scientific article; zbMATH DE number 1047679

Cited in

(6)

• Basis- and partition identification for quadratic programming and linear complementarity problems
• scientific article; zbMATH DE number 4182797 (Why is no real title available?)
• Recovering an optimal LP basis from an interior point solution
• On Estimating Optimal Bases for Linear Programs
• scientific article; zbMATH DE number 3858846 (Why is no real title available?)
• Recovering an optimal LP basis from an optimal dual solution

Describes a project that uses

Uses Software

• Mosek

This page was built for publication: On Exploiting Problem Structure in a Basis Identification Procedure for Linear Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427366)