Decomposition of generalized vector variational inequalities

Publication year: 2011
Source: Nonlinear Analysis: Theory, Methods & Applications, In Press, Corrected Proof, Available online 14 June 2011

Nicolae, Popovici , Matteo, Rocca

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.