In this note, by using some well-known results on properly efficient soluti
ons of vector optimization problems, we show that the Pareto solution set o
f a vector variational inequality with a polyhedral constraint set can be e
xpressed as the union of the solution sets of a family of (scalar) variatio
nal inequalities.