A parametric approach to complementarity theory (Q1079132)

A generalization of the parametric linear complementarity problem, called the parametric complementarity problem (PCP) has been studied. Let \(W\subset R^ m\) be an interval of the type \(R^ k_+\times R^ k_+\times Q\) where 2k\(\leq m\) with nonempty interior. Given a mapping f(x,y,z): \(W\to R^ n\), where \(x,y\in R^ k\), the PCP is to find a solution to the system: (x,y,z)\(\in W\), \(f(x,y,z)=0\), and \(x^ Ty=0\). The order of this PCP is defined to be m-k-n. Let S be the solution set of this PCP. Under the assumptions that the order is 1, that the PCP is nondegenerate, and that S is compact, it has been shown that the number of connected components of S is finite, and each connected component of S is a path: Given two PCPs of order 0, the question of whether there is a PCP of order 1 such that the endpoints of the paths generated by this PCP coincide with the solutions of the PCPs of order 0 has been investigated. Such a PCP of order 1 is called a bridge between the original PCPs of order 0. Sufficient conditions for the existence and constructability of bridges have been given, and a constant parity property of the number of solutions of two PCPs is proved when a bridge exists between them.