| Summary: | 碩士 === 國立臺灣大學 === 農業工程學研究所 === 88 === A Reservoir Goal Linear Programming Model was formulated for a single reservoir in this thesis. It can be treated as a potential network model. The dual model of potential network is a network flow problem. Both potential and network flow model have special structures. Therefore, applying different algorithms to solve the problems may have different efficiency. In the thesis, four different methods were presented for solving the Reservoir and its dual problems, and were compared in detail.
The Simplex, Dual Simplex, Primal-Dual, and Out-of-Kilter Method were used to solve network problems. First, Potential Network Simplex, and Potential Network Dual Simplex Method were offered to solve Reservoir Problem. Then, Flow Network Simplex, and Flow Network Dual Simplex Method were used to solve the Dual Problem. Finally, the Primal-Dual and Out-of-Kilter Method were presented. Iterating between the primal and dual problem, the algorithms stop until the optimal solution is determined.
|
|---|
