More with the Lemke complementarity algorithm

Joseph J.M. Evers

    Research output: Contribution to journalArticleAcademic

    12 Citations (Scopus)
    154 Downloads (Pure)


    In the case that the matrix of a linear complementarity problem consists of the sum of a positive semi-definite matrix and a co-positive matrix a general condition is deduced implying that the Lemke algorithm will terminate with a complementarity solution. Applications are presented on bi-matrix games, convex quadratic programming and multi-period programs.
    Original languageUndefined
    Pages (from-to)214-219
    JournalMathematical programming
    Issue number1
    Publication statusPublished - 1978


    • IR-85625

    Cite this