Mixed linear complementarity problem
From Wikipedia the free encyclopedia
In mathematical optimization theory, the mixed linear complementarity problem, often abbreviated as MLCP or LMCP, is a generalization of the linear complementarity problem to include free variables.
References[edit]
- Complementarity problems
- Algorithms for complementarity problems and generalized equations
- An Algorithm for the Approximate and Fast Solution of Linear Complementarity Problems
 | This linear algebra-related article is a stub. You can help Wikipedia by expanding it. |
 | This mathematical analysis–related article is a stub. You can help Wikipedia by expanding it. |