MINOS 5.5: optimal solution found.
11 iterations, objective 0
Nonlin evals: constrs = 35, Jac = 34.
Objective = find a feasible point.
x [*] :=
1   783.635
2  1737.49
3  4624.21
4   196.927
5   315.032
6   203.073
7   281.895
8   415.032
;