MINOS 5.5: unbounded (or badly scaled) problem.
40 iterations
Nonlin evals: constrs = 112, Jac = 111.
Objective = find a feasible point.
a = 0.00113639
b = -735.618
c = 1860760
d = -762631
e = -1097390
i = -17704.5