MINOS 5.5: optimal solution found.
54 iterations, objective 0
Nonlin evals: constrs = 76, Jac = 75.
Objective = find a feasible point.
x [*] :=
1   774.696
2  1019.38
3     0.0701426
4    -0.389665
5   252
6   252
7   209.892
8   359.522
9   328.483
;