| Summary: | 碩士 === 國立臺灣大學 === 農業工程研究所 === 83 === Two reservoir yield models are formulated. The first model
assumes that (1) the required amount of water in each period for
a crop is fixed, (2) shortages of goals have their different
costs or profits, (3) the yield and storages for goals need to
be determined. The best operation of the reservoir is to be
determined. The second model assumes that planting area of crops
are to be decided, so are amouts of water for crpos and the
storages in goals.
The algorithms for the models rely on Rosen's partition
procedure for angular linear program and Liu's network cut
method of linear goal programming model for reservoir. The
problem is partitioned into several parts and then solved
interatively in two levels. In the first level, amounts of
supplied water for crops are determined. In the second level,
the subproblem of component reservoir operation is solved.
The partition overcomes the problem of computer memory
requirement, while the network cut method efficiently save
computer time. Because network stucture is preserved in one of
the level of the algorithm, the operational and economical
interpretations are expected to fascilitate the promotion of
the model and the algorithm.
|
|---|
