| Popis: |
With the standard assumptions of known inflows and requirements and final storage equal to or exceeding initial storage, the linear programming approach to determining the capacity of a single reservoir is equivalent to the sequent peak algorithm in that they must produce the same reservoir capacity. The sequence of storages and spills is not unique; the usual version of the sequent peak algorithm produces one sequence, while the linear programming approach may produce that sequence or some other. The subsequence of storages during critical drawdown periods must be the same, however. There exists a unique operating policy for a reservoir of minimum required capacity if one of two conditions is met: (1) the average inflow equals the average requirement; (2) all refill cycles are exactly one season long. An iterative method of accounting for evaporation losses in the sequent peak algorithm can be used; it has been found in practice to converge to the same reservoir capacity as that found by linear programming. |
