Ovoid (polar space): Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Qetuth
m more specific stub type +'in mathematics' intro
 
en>DoctorKubla
rm deprecated wikify tag
Line 1: Line 1:
The writer is known by the title of Numbers Lint. For many years he's been working as a receptionist. To collect cash is 1 of the things I adore most. South Dakota is her birth place but she requirements to transfer because of her family.<br><br>Here is my web-site :: std home test [[http://indianrajneet.com/groups/best-strategies-for-keeping-candida-albicans-from-increasing/ visit this web-site]]
'''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 <math>F(x): \mathbb{R}^n \to \mathbb{R}^n</math>, lower values <math>\ell_i \in \mathbb{R} \cup \{-\infty\}</math> and upper values <math>u_i \in \mathbb{R}\cup\{\infty\}</math>.
 
The '''solution''' of the MCP is a vector <math>x \in \mathbb{R}^n</math> such that for each index <math>i \in \{1, \ldots, n\}</math> one of the following alternatives holds:
* <math>x_i = \ell_i, \; F_i(x) \ge 0</math>;
* <math>\ell_i < x_i < u_i, \; F_i(x) = 0</math>;
* <math>x_i = u_i, \; F_i(x) \le 0</math>.
 
Another definition for MCP is: it is a [[variational inequality]] on the [[parallelepiped]] <math>[\ell, u]</math>.
 
== See also ==
* [[Complementarity theory]]
 
== References ==
 
* {{cite paper|author=Stephen C. Billups|title=Algorithms for complementarity problems and generalized equations|date=1995|
url=ftp://ftp.cs.wisc.edu/math-prog/tech-reports/95-14.ps|
format=[[Adobe Photoshop|PS]]|accessdate=2006-08-14}}
* {{cite book|author=Francisco Facchinei, Jong-Shi Pang|title=Finite-Dimensional Variational Inequalities and Complementarity Problems, Volume I|date=2003}}
 
{{Mathematical programming}}
 
[[Category:Mathematical optimization]]

Revision as of 08:47, 6 October 2012

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 , lower values and upper values .

The solution of the MCP is a vector such that for each index one of the following alternatives holds:

Another definition for MCP is: it is a variational inequality on the parallelepiped .

See also

References

Template:Mathematical programming