| Display title | Mixed linear complementarity problem |
| Default sort key | Mixed linear complementarity problem |
| Page length (in bytes) | 850 |
| Namespace ID | 0 |
| Page ID | 186775 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>LinXED |
| Date of page creation | 09:10, 31 July 2022 |
| Latest editor | imported>LinXED |
| Date of latest edit | 09:10, 31 July 2022 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | 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. |
