Abstract
In this note, by using some well-known results on properly efficient solutions of vector optimization problems, we show that the Pareto solution set of a vector variational inequality with a polyhedral constraint set can be expressed as the union of the solution sets of a family of (scalar) variational inequalities.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have