Pareto reducibility of vector variational inequalities
A multicriteria optimization problem is called Pareto reducible if its weakly efficient solutions are Pareto solutions of the problem itself or a subproblem obtained from it by selecting certain criteria. The aim of this paper is to introduce a similar concept of Pareto reducibility for a class of vector variational inequalities. Key words: Vector variational inequality, Pareto reducibility. 2000 Mathematics Subject Classification: 49J40, 90C29.