نتایج جستجو برای: complementarity problem
تعداد نتایج: 889803 فیلتر نتایج به سال:
Although the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the defining matrix is nondegenerate and for which the n-step property holds. In this paper we consider an extension of the property to the degenerate case by introducing the concept of an extended n-step vector and matrix. It i...
In this article, we introduce the class of semimonotone star ($E_0^s$) matrices. We establish importance $E_0^s$-matrices in context complementarity theory. show that principal pivot transform $E_0^s$-matrix is not necessarily $E_0^s$ general. However, prove $\tilde{E_0^s}$-matrices, a subclass with some additional conditions, $E_0^f$ by showing $P_0.$ LCP$(q, A)$ can be processable Lemke's alg...
We revisit the class of column competent matrices and study some matrix theoretic properties this class. The local w-uniqueness solutions to linear complementarity problem can be identified by matrices. establish new results on in connection with These are significant context theory as well algorithms operations research. prove locally property Finally, we a between adequate help degree theory.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید