MINOS 5.5: MINOS 5.5: optimal solution found.
30 iterations, objective 0
Nonlin evals: constrs = 132, Jac = 131.
Objective = find a feasible point.
x [*] :=
  1 -3.13184    21  1          41  1          61  1          81  1
  2  1          22  4.40777    42  1          62  1          82  1
  3  1          23  1          43  1          63  1          83  1
  4  4.40326    24  1          44  1          64  1          84  1
  5  1          25  3.7821     45  1          65  1          85  1
  6  1          26  1          46  1          66  1          86  1
  7  4.13932    27  1          47  1          67  1          87  1
  8  1          28  4.11685    48  1          68  1          88  1
  9  1          29  1          49  1          69  1          89  1
 10  7.80795    30  1          50  1          70  1          90  1
 11  1          31  2.30738    51  1          71  1          91  1
 12  1          32  1          52  1          72  1          92  1
 13  3.31651    33  1          53  1          73  1          93  1
 14  1          34  1          54  1          74  1          94  1
 15  1          35  1          55  1          75  1          95  1
 16  4.34218    36  1          56  1          76  1          96  1
 17  1          37  1          57  1          77  1          97  1
 18  1          38  1          58  1          78  1          98  1
 19  3.50047    39  1          59  1          79  1          99  1
 20  1          40  1          60  1          80  1         100  1
;