Solving linear programs with complementarity constraints using branch-and-cut (Q2281449)

From MaRDI portal
Revision as of 14:10, 2 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Solving linear programs with complementarity constraints using branch-and-cut
scientific article

    Statements

    Solving linear programs with complementarity constraints using branch-and-cut (English)
    0 references
    0 references
    0 references
    0 references
    19 December 2019
    0 references
    linear programs with complementarity constraints
    0 references
    MPECs
    0 references
    branch-and-cut
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references