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. The case of a discontinuous mapping was discussed by Habetler and Kostreva (1978).
YouTube Encyclopedic
-
1/3Views:4 1737134 731
-
Lecture 16 Conic programming 1
-
ECE 804 - Spring 2011 - Lecture 003 with Dr. Shu Lu - Feb. 11, 2011
-
Operations Research 05D: Complementary Slackness
Transcription
References
- Ahuja, Kapil; Watson, Layne T.; Billups, Stephen C. (December 2008). "Probability-one homotopy maps for mixed complementarity problems". Computational Optimization and Applications. 41 (3): 363–375. doi:10.1007/s10589-007-9107-z. hdl:10919/31539.
- Cottle, Richard W.; Pang, Jong-Shi; Stone, Richard E. (1992). The linear complementarity problem. Computer Science and Scientific Computing. Boston, MA: Academic Press, Inc. pp. xxiv+762 pp. ISBN 0-12-192350-9. MR 1150683.
This page was last edited on 3 December 2023, at 19:25