Ovoid (polar space)

From formulasearchengine
Revision as of 07:47, 6 October 2012 by en>DoctorKubla (rm deprecated wikify tag)
Jump to navigation Jump to search

Mixed Complementarity Problem (MCP) is a problem formulation in mathematical programming. Many well-known problem types are special cases of, or may be reduced to MCP. It is a generalization of Nonlinear complementarity problem (NCP).

Definition

The mixed complementarity problem is defined by a mapping F(x):nn, lower values i{} and upper values ui{}.

The solution of the MCP is a vector xn such that for each index i{1,,n} one of the following alternatives holds:

Another definition for MCP is: it is a variational inequality on the parallelepiped [,u].

See also

References

Template:Mathematical programming