Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs.
O. L. MangasarianPublished in: Math. Oper. Res. (1979)
Keyphrases
- linear program
- linear complementarity problem
- interior point
- np hard
- linear programming
- quadratic program
- interior point methods
- primal dual
- linear programming problems
- simplex method
- optimal solution
- special case
- np complete
- column generation
- mixed integer
- integer program
- variational inequalities
- dynamic programming
- objective function
- sufficient conditions
- semidefinite
- semidefinite programming
- computational complexity
- approximation algorithms
- linear systems