Nonemptiness and Compactness of Solution Sets to Generalized Polynomial Complementarity Problems

Abstract

In this paper, we investigate the generalized polynomial complementarity problem, which is a subclass of generalized complementarity problems with the involved map pairs being two polynomials. Based on the analysis on two structured tensor pairs located in the heading items of polynomials involved, and by using the degree theory, we achieve several results on the nonemptiness and compactness of solution sets. When generalized polynomial complementarity problems reduce to polynomial complementarity problems (or tensor complementarity problems), our results reduce to the existing ones. In particular, one of our results broadens the one proposed in a very recent paper to guarantee the nonemptiness and compactness of solution sets to generalized polynomial complementarity problems. Furthermore, we establish several existence and uniqueness results, which enrich the theory of generalized complementarity problems with the observation that some known conditions to guarantee the existence and uniqueness of solutions may not hold for a lot of generalized polynomial complementarity problems.