Finding duplicate rows in a linear programming model (Q1090077)

From MaRDI portal
Revision as of 19:14, 17 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding duplicate rows in a linear programming model
scientific article

    Statements

    Finding duplicate rows in a linear programming model (English)
    0 references
    0 references
    1986
    0 references
    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.
    0 references
    size reduction
    0 references
    duplicate rows
    0 references
    linear programming matrix
    0 references
    simplex method
    0 references

    Identifiers