MINOS 5.5: unbounded (or badly scaled) problem.
34 iterations
Nonlin evals: constrs = 32, Jac = 31.
Objective = find a feasible point.
X = -9.90218
Y = 1e+08
Z = 1e+08
v1 = -0.0265625
v10 = 0.053125
v11 = -0.0265625
v12 = -0.053125
v2 = -0.132813
v20 = -0.0265625
v21 = -0.132812
v22 = -0.0265625
v23 = -0.0265625
v24 = -0.0177083
v25 = -0.10625
v26 = -0.0265625
v27 = -0.0265625
v28 = -0.0265625
v29 = -0.053125
v3 = -0.0265625
v30 = 0.0265625
v31 = 0.053125
v4 = -0.0265625
v40 = 0.239062
v41 = 0.0265625
v5 = -0.0177083
v6 = -0.10625
v7 = -0.0265625
v8 = -0.0265625
v9 = 0.0265625