MINOS 5.5: optimal solution found.
277 iterations, objective 0
Nonlin evals: constrs = 609, Jac = 608.
Objective = find a feasible point.
x [*,*]
:         1             2             3              4           6       :=
1    2.73777e-05   0.652669       1.5e-06       0.000256946   4.5e-06
2    0.156575      0.00122908     0.00400792    1.5e-06       1.5e-06
3    3.70263       5.38652e-05    0.0025529     1.5e-06        .
4    0.573161      0.023163       0.187267       .             .
5     .            1.5e-06        1.5e-06        .             .
6     .            0.00377422     0.0762758      .             .
7     .            0.00294148     0.0851885      .             .
8     .            0.00200575     0.0462842      .             .
9     .            9.19273       37.1437         .             .
10    .            1.5e-06        1.5e-06        .             .
11    .            3.54536e-05    0.120087       .             .
12    .            1.5e-06        0.17753        .             .
13    .            0.0155         0.0211275      .             .
14    .             .             0.00202225     .             .
15    .             .             0.000245054    .             .
16    .             .             2.19606e-06    .             .
17    .             .             1.5e-06        .             .
18    .             .             1.5e-06        .             .
;