Finding duplicate rows in a linear programming model

From MaRDI portal





An algorithm for identifying and disposing of duplicate rows in a linear programming matrix is presented. This approach allows to reduce the model size in linear programming problems which decreases the cost of solution as well. It may also detect infeasible models and remove a potential source of numerical trouble in the simplex method. An example is presented, and computational experience is reported.











This page was built for publication: Finding duplicate rows in a linear programming model

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