MINOS 5.5: unbounded (or badly scaled) problem.
10 iterations
Nonlin evals: constrs = 14, Jac = 13.
Objective = find a feasible point.
d1 = -1e+08
d2 = -1e+08
d3 = -1e+08
q1 = 99999900
q2 = 1e+08
q3 = 99999900