We investigate optimal control problems governed by variational inequalities, and more precisely the obstacle problem. Since we adopt a numerical point of view, we first relax the feasible domain of the problem; then using both mathematical programming methods and penalization methods we get optimality conditions with smooth lagrange multipliers.