Decomposition of generalized vector variational inequalities

A multicriteria optimization problem is called Pareto reducible if its weakly efficient solutions actually are efficient solutions for the problem itself or for at least one subproblem obtained from it by selecting certain criteria. The aim of this paper is to investigate a similar property within a special class of generalized vector variational inequalities, under appropriate generalized convexity assumptions.