MINOS 5.5: unbounded (or badly scaled) problem.
6 iterations
Nonlin evals: constrs = 18, Jac = 17.
Objective = find a feasible point.
w1 = -76682.5
w2 = 76683.5
x1 = 223.831
x2 = 0