Mixed linear complementarity problem

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

This algebra-related article is a stub. You can help Wikipedia by expanding it.v · Categories: Linear algebra Mathematical optimization Algebra stubs Wikimedia Foundation. 2010. Игры ⚽ Нужно решить контрольную? Mixed hockey Mixed martial arts competition for children Look at other dictionaries: 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… …   Wikipedia Nonlinear complementarity problem — In applied mathematics, a nonlinear complementarity problem (NCP) with respect to a mapping ƒ : Rn → Rn, denoted by NCPƒ, is to find a vector x ∈ Rn such that where ƒ(x) is a smooth mapping. References Stephen C.… …   Wikipedia Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …   Wikipedia Complementarity theory — This article is related to mathematical programming. For other uses see complementarity. A complementarity problem is a type of mathematical optimization problem. It is the problem of optimizing (minimizing or maximizing) a function of two vector …   Wikipedia List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra …   Wikipedia Criss-cross algorithm — This article is about an algorithm for mathematical optimization. For the naming of chemicals, see crisscross method. The criss cross algorithm visits all 8 corners of the Klee–Minty cube in the worst case. It visits 3 additional… …   Wikipedia Optimization (mathematics) — In mathematics, the term optimization, or mathematical programming, refers to the study of problems in which one seeks to minimize or maximize a real function by systematically choosing the values of real or integer variables from within an… …   Wikipedia List of mathematics articles (M) — NOTOC M M estimator M group M matrix M separation M set M. C. Escher s legacy M. Riesz extension theorem M/M/1 model Maass wave form Mac Lane s planarity criterion Macaulay brackets Macbeath surface MacCormack method Macdonald polynomial Machin… …   Wikipedia General Algebraic Modeling System — Infobox Software name = GAMS developer = [http://www.gams.com GAMS Development Corporation] latest release version = 22.8.1 latest release date = August 1, 2008 platform = Cross platform status = Active license = Proprietary genre = Algebraic… …   Wikipedia Contact dynamics — deals with the motion of multibody systems subjected to unilateral contacts and friction. Such systems are omnipresent in many multibody dynamics applications. Consider for example Contacts between wheels and ground in vehicle dynamics Squealing… …   Wikipedia 18+ © Academic, 2000-2024 Contact us: Technical Support, Advertising Dictionaries export, created on PHP, Joomla, Drupal, WordPress, MODx. Mark and share Search through all dictionaries Translate… Search Internet Share the article and excerpts Direct link … Do a right-click on the link above and select “Copy Link”