MINOS 5.5: optimal solution found.
34 iterations, objective 0
Nonlin evals: constrs = 50, Jac = 49.
Objective = find a feasible point.
x [*] :=
 1   1699.64
 2  16000
 3     53.4643
 4   3032.49
 5   2000
 6     90.0135
 7     94.9957
 8     10.5905
 9      1.56428
10    153.522
;