A Pivoting Algorithm for Linear Programming with Linear Complementarity Constraints

  • Haw-ren Fang
  • Sven Leyffer
  • Todd S. Munson
    • Categories Complementarity and Variational Inequalities Tags , , Short URL: https://optimization-online.org/?p=10961

    We present a pivoting algorithm for solving linear programs with linear complementarity constraints. Our method generalizes the simplex method for linear programming to deal with complementarity conditions. We develop an anticycling scheme that can verify Bouligand stationarity. We also give an optimization-based technique to find an initial feasible vertex. Starting with a feasible vertex, our algorithm always finds a minimizer or an unbounded descent search direction in a finite number of pivoting steps.

    Citation

    Preprint ANL/MCS-P1680-1009, Argonne National Laboratory, Mathematics and Computer Science Division, October 2009.

    Article

    Download

    View A Pivoting Algorithm for Linear Programming with Linear Complementarity Constraints