MINOS 5.5: optimal solution found.
24 iterations, objective 0
Nonlin evals: constrs = 136, Jac = 135.
Objective = find a feasible point.
x [*] :=
 1  0.902872
 2  0.805744
 3  0.708616
 4  0.61149
 5  0.51436
 6  0.417232
 7  0.320104
 8  0.222977
 9  0.125849
10  0.0287294
;