A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints (Q697548)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints
scientific article

    Statements

    A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints (English)
    0 references
    17 September 2002
    0 references
    quadratic program
    0 references
    linear complementarity constraints
    0 references
    branch-and-bound algorithm
    0 references
    extreme point algorithm
    0 references
    globally
    0 references
    local search method
    0 references
    numerical experiment
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references