Connectedness structure of the solution sets of vector variational inequalities

By a scalarization method and properties of semi-algebraic sets, it is proved that both the Pareto solution set and the weak Pareto solution set of a vector variational inequality, where the constraint set is polyhedral convex and the basic operators are given by polynomial functions, have finitely many connected components. Consequences of the results for vector optimization problems are discussed in details. The results of this paper solve in the affirmative some open questions for the case of general problems without requiring monotonicity of the operators involved. © 2016 Informa UK Limited, trading as Taylor & Francis Group.