MINOS 5.5: optimal solution found.
0 iterations, objective 0
Nonlin evals: constrs = 5, Jac = 4.
Objective = find a feasible point.
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