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