Mixed linear complementarity problem

Method in linear algebra

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

  • Complementarity problems
  • Algorithms for complementarity problems and generalized equations
  • An Algorithm for the Approximate and Fast Solution of Linear Complementarity Problems
  • v
  • t
  • e
Complementarity problems and algorithms
Complementarity Problems
  • Linear programming (LP)
  • Quadratic programming (QP)
  • Linear complementarity problem (LCP)
  • Mixed linear (MLCP)
  • Mixed (MCP)
  • Nonlinear (NCP)
Basis-exchange algorithms
  • Simplex (Dantzig)
  • Revised simplex
  • Criss-cross
  • Lemke


Stub icon

This linear algebra-related article is a stub. You can help Wikipedia by expanding it.

  • v
  • t
  • e
Stub icon

This mathematical analysis–related article is a stub. You can help Wikipedia by expanding it.

  • v
  • t
  • e