MINOS 5.5: optimal solution found.
3 iterations, objective 0
Nonlin evals: constrs = 12, Jac = 11.
Objective = find a feasible point.
x [*] :=
1  -0.0140088
2  -1.34445
;

u = 1