MINOS 5.5: optimal solution found.
20 iterations, objective 0
Nonlin evals: constrs = 10, Jac = 9.
Objective = find a feasible point.
x [*] :=
 1 0.0434298      7 0.0123541     13 0.349986      19 0.04
 2 0.019369       8 0.0933229     14 0.04          20 0.0431658
 3 0.0134354      9 0.04          15 0.04          21 0.00547233
 4 0             10 0.0346891     16 0             22 0.04
 5 0.00724908    11 5.5665e-05    17 0.04          23 3.08244e-06
 6 0.0341585     12 0.04          18 0.0616412     24 0.00166776
;