A dual projective simplex method for linear programming (Q1129474)

From MaRDI portal
Revision as of 14:56, 28 May 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
A dual projective simplex method for linear programming
scientific article

    Statements

    A dual projective simplex method for linear programming (English)
    0 references
    2 March 1999
    0 references
    least squares problem
    0 references
    projective simplex method
    0 references
    dual crash heuristic
    0 references
    NETLIB
    0 references
    0 references

    Identifiers