MINOS 5.5: optimal solution found.
9 iterations, objective 0
Nonlin evals: constrs = 5, Jac = 4.
Objective = find a feasible point.
l0 = 0
l1 = 0.104562
l10 = 18.2508
l2 = 0.346721
l3 = 0.770487
l4 = 1.43513
l5 = 2.42146
l6 = 3.84121
l7 = 5.85141
l8 = 8.67677
l9 = 12.6458
u1 = 10.4459
u10 = 0.560498
u11 = 0
u2 = 9.40031
u3 = 8.31059
u4 = 7.18055
u5 = 6.01743
u6 = 4.83383
u7 = 3.6507
u8 = 2.50202
u9 = 1.44251
x1 = -0.043165
x10 = -0.0754165
x2 = -0.0815772
x3 = -0.114486
x4 = -0.140974
x5 = -0.159909
x6 = -0.169877
x7 = -0.16909
x8 = -0.15525
x9 = -0.125356