MINOS 5.5: unbounded (or badly scaled) problem.
12 iterations
Nonlin evals: constrs = 23, Jac = 22.
Objective = find a feasible point.
D = 0.3
X1 = 1
X2 = 0.6625
X3 = 880.786
X4 = 101.334
X5 = 0.6625
Y1 = 0
Y2 = 1e+08
Y3 = 1e+08
Y4 = 1e+08
Y5 = 1e+08