MINOS 5.5: MINOS 5.5: infeasible problem (or bad starting guess).
124 iterations
Nonlin evals: constrs = 686, Jac = 685.
Objective = find a feasible point.
x :=
1  1     -145.216
1  2        1
2  1      -14.5394
2  2     -178.235
3  1    49730.1
3  2        2.99175
4  1       12.8859
4  2        3.44758
5  1        6.6282
5  2   -16593.9
6  1        6
6  2      106.608
7  1       28.466
7  2      183.035
8  1        8
8  2     5548.22
9  1      405.182
9  2        3.59903
10 1        8.35584
10 2    -1592.96
;

r [*,*]
:        1           2          3          4          5          6        :=
2      221.814        .           .         .           .        .
3    49875.3     49745            .         .           .        .
4      158.12      183.741   49717.2        .           .        .
5    16595.6     16415.7     52420.2   16597.4          .        .
6      184.443     285.582   49724.2     103.39    16700.5       .
7      251.599     363.82    49702       180.262   16777       79.6611
8     5549.33     5726.5     50030.4    5544.77    22142.1   5441.61
9      550.404     457.416   49324.9     392.296   16602.3    412.259
10    1601.34     1414.91    49747.4    1596.41    15000.9   1699.57

:       7          8         9       :=
8    5365.22        .         .
9     417.268   5558.83       .
10   1776.11    7141.17   1645.13
;