**An Introduction to Vector Variational Inequalities and Some New Results **

* Nguyen Dong Yen *

**Abstract**

This survey paper discusses some new results on vector variational inequalities. It can serve as an elementary introduction to vector variational inequalities and vector optimization problems. The focus point is made on the results about connectedness structure of the solution sets, which are obtained by a scalarization method and properties of semi-algebraic sets. The first major theorem says that both Pareto solution set and 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. The second major theorem asserts that both proper Pareto solution set and weak Pareto solution set of a vector variational inequality, where the convex constraint set is given by polynomial functions and all the components of the basic operators are polynomial functions, have finitely many connected components, provided that the Mangasarian-Fromovitz Constraint Qualification is satisfied at every point of the constraint set. In addition, it has been established that if the proper Pareto solution set is dense in the Pareto solution set, then the latter also has finitely many connected components. Consequences of the results for vector optimization problems are shown.