Optimality Conditions for Multiobjective Optimization Problem Constrained by Parameterized Variational Inequalities

We study a multiobjective optimality problem constrained by parameterized variational inequalities. By separation theorem for convex sets, we translate the multiobjective optimality problem into single objective optimality problem, and obtain the first-order optimality conditions of this problem. Under the calmness conditions, an efficient upper estimate of coderivative for a composite set-valued mapping is derived. At last, we apply that result to the multiobjective bilevel programming problem and MPEC with Nash equilibrium constraints.