MINOS 5.5: optimal solution found.
100 iterations, objective 0
Nonlin evals: constrs = 204, Jac = 203.
Objective = find a feasible point.
:        v           d           h        :=
1 0   350            .            .
1 1   349.418   1.87753       27.6558
1 2   350.546   0.168361       2.48058
1 3   349.579   2.26264       33.3394
1 4   350       0.875475      12.8966
2 0   158            .            .
2 1   156.508   3.456         18.1161
2 2   154.689   2.0736        10.8154
2 3   157.038   3.40029e-17    0
2 4   158       0              0
;

:        P         rI      rD  gI     gD       :=
1 1   234.228   15.7719    65   0   69.2281
1 2   236.704   13.2959    65   0   71.7041
1 3   241.661    8.33942   65   0   76.6606
1 4   237.103   12.8966    65   0   72.1034
;

htot [*] :=
1  45.7719
2  13.2959
3  33.3394
4  12.8966
;