MINOS 5.5: ignoring integrality of 100 variables
MINOS 5.5: optimal solution found.
255 iterations, objective 0
Nonlin evals: constrs = 566, Jac = 565.
Objective = find a feasible point.
x [*,*] (tr)
:       1           2          3          4         5       :=
1      0         0           0          0        54.5145
2     12.4853    0.447522    2.35038    0        52.7326
3      0         0           0          0        45.5598
4      0        22.3617      0          0         0
5      0        21.0091      0          0         0
6    100         0           0          0         0
7     40.7501    0           0          0         0
8     27.2533    0           0          0         0
9     19.5114    0           0          0         0
10     0         0           0          0        51.0756
11     0         0           0         36.1718    0
12     0         0           0         42.6344    0
13     0         0           0          0        46.1174
14     0         0           0         58.2404    0
15     0        26.6881     43.3119     0         0
16     0        29.4936      0         12.9534    0
17     0         0          77.6969     0         0
18     0         0          54.1231     0         0
19     0         0          56.1028     0         0
20     0         0          66.415      0         0
;