MINOS 5.5: optimal solution found.
24 iterations, objective 0
Nonlin evals: constrs = 30, Jac = 29.
Objective = find a feasible point.
x [*] :=
1   952.701
2  1264.9
3  4902.14
4   206.683
5   303.914
6   193.317
7   302.769
8   403.914
;