Addendum to ``Presolve analysis of linear programs prior to applying an interior point method

DOI10.1287/IJOC.13.2.169.10519zbMATH Open1238.90095OpenAlexW2086885747MaRDI QIDQ2884503FDOQ2884503

Authors: Csaba Mészáros, Jacek Gondzio 

Publication date: 30 May 2012

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

Full work available at URL: https://doi.org/10.1287/ijoc.13.2.169.10519

Recommendations

• Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
• Presolving in linear programming
• Formal optimization of some reduced linear programming problems
• Correction to: `Multilinear programming: Duality theories'
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming

zbMATH Keywords

linear programminginterior-point methodspresolving

Mathematics Subject Classification ID

Linear programming (90C05)

Cited In (2)

• Strong duality and minimal representations for cone optimization
• Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method

This page was built for publication: Addendum to ``Presolve analysis of linear programs prior to applying an interior point method

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