MINOS 5.5: unbounded (or badly scaled) problem.
75 iterations
Nonlin evals: constrs = 158, Jac = 157.
Objective = find a feasible point.
i = -0.102847
z0 = 2853.75
z1 = -0.000712651
z2 = 267867
z3 = 25502
z4 = 343492
z5 = -341066
z6 = -298648