MINOS 5.5: optimal solution found.
11 iterations, objective 0
Nonlin evals: constrs = 5, Jac = 4.
Objective = find a feasible point.
l0 = 0
l1 = 0.0511918
l10 = 4.65462
l11 = 5.95774
l12 = 7.52629
l13 = 9.40746
l14 = 11.6582
l15 = 14.3477
l16 = 17.5603
l17 = 21.3998
l18 = 25.9945
l19 = 31.5047
l2 = 0.161453
l20 = 38.1319
l3 = 0.339905
l4 = 0.597133
l5 = 0.945463
l6 = 1.39928
l7 = 1.97545
l8 = 2.69376
l9 = 3.57759
u1 = 20.4716
u10 = 10.4891
u11 = 9.30439
u12 = 8.11973
u13 = 6.94332
u14 = 5.78568
u15 = 4.6603
u16 = 3.58451
u17 = 2.58058
u18 = 1.67717
u19 = 0.911382
u2 = 19.4478
u20 = 0.331359
u21 = 0
u3 = 18.4003
u4 = 17.3296
u5 = 16.2364
u6 = 15.1217
u7 = 13.9872
u8 = 12.8348
u9 = 11.6676
x1 = -0.0232104
x10 = -0.163543
x11 = -0.168815
x12 = -0.171266
x13 = -0.170605
x14 = -0.166499
x15 = -0.158564
x16 = -0.146361
x17 = -0.129378
x18 = -0.107016
x19 = -0.0785774
x2 = -0.045202
x20 = -0.0432334
x3 = -0.065881
x4 = -0.0851437
x5 = -0.102875
x6 = -0.118948
x7 = -0.13322
x8 = -0.145532
x9 = -0.155707