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.025305
l10 = 1.76424
l11 = 2.17758
l12 = 2.64809
l13 = 3.1803
l14 = 3.77912
l15 = 4.44987
l16 = 5.19835
l17 = 6.03088
l18 = 6.95436
l19 = 7.97631
l2 = 0.077837
l20 = 9.10494
l21 = 10.3492
l22 = 11.7191
l23 = 13.2252
l24 = 14.8796
l25 = 16.6951
l26 = 18.6863
l27 = 20.8689
l28 = 23.2604
l29 = 25.8802
l3 = 0.159666
l30 = 28.7497
l31 = 31.8927
l32 = 35.3356
l33 = 39.108
l34 = 43.2426
l35 = 47.7764
l36 = 52.7504
l37 = 58.211
l38 = 64.2103
l39 = 70.807
l4 = 0.273022
l40 = 78.0676
l5 = 0.420311
l6 = 0.604128
l7 = 0.827275
l8 = 1.09278
l9 = 1.40392
u1 = 40.4854
u10 = 30.9457
u11 = 29.8288
u12 = 28.7015
u13 = 27.5644
u14 = 26.4181
u15 = 25.2632
u16 = 24.1006
u17 = 22.9311
u18 = 21.7558
u19 = 20.5758
u2 = 39.4732
u20 = 19.3924
u21 = 18.2074
u22 = 17.0223
u23 = 15.8393
u24 = 14.6606
u25 = 13.4887
u26 = 12.3268
u27 = 11.178
u28 = 10.0463
u29 = 8.93598
u3 = 38.4489
u30 = 7.85193
u31 = 6.79979
u32 = 5.78592
u33 = 4.81759
u34 = 3.90308
u35 = 3.05182
u36 = 2.27461
u37 = 1.58377
u38 = 0.993435
u39 = 0.519809
u4 = 37.4124
u40 = 0.181516
u41 = 0
u5 = 36.3638
u6 = 35.3033
u7 = 34.2311
u8 = 33.1472
u9 = 32.052
x1 = -0.0120421
x10 = -0.104991
x11 = -0.113338
x12 = -0.121228
x13 = -0.128639
x14 = -0.135551
x15 = -0.141941
x16 = -0.147786
x17 = -0.15306
x18 = -0.157738
x19 = -0.161789
x2 = -0.0237755
x20 = -0.165185
x21 = -0.167892
x22 = -0.169877
x23 = -0.171103
x24 = -0.17153
x25 = -0.171116
x26 = -0.169817
x27 = -0.167583
x28 = -0.164364
x29 = -0.160104
x3 = -0.0351887
x30 = -0.154741
x31 = -0.148212
x32 = -0.140447
x33 = -0.13137
x34 = -0.120898
x35 = -0.108944
x36 = -0.0954098
x37 = -0.0801907
x38 = -0.0631718
x39 = -0.0442276
x4 = -0.0462692
x40 = -0.0232206
x5 = -0.0570041
x6 = -0.0673798
x7 = -0.0773819
x8 = -0.0869952
x9 = -0.0962038