MINOS 5.5: unbounded (or badly scaled) problem.
3 iterations
Nonlin evals: constrs = 26, Jac = 25.
Objective = find a feasible point.
x = 2.73317e-07
y = 1e+08
z = 1e+08