Optimization problems with complementarity constraints are closely related
to optimization problems with variational inequality constraints and bileve
l programming problems. In this paper, under mild constraint qualifications
, we derive some necessary and sufficient optimality conditions involving t
he proximal coderivatives. As an illustration of applications, the result i
s applied to the bilevel programming problems where the lower level is a pa
rametric linear quadratic problem.