Two Methods for Solving Reservoir Goal Linear Programming and its Dual Problem
Date Issued
2005
Date
2005
Author(s)
Liu, Chia-Wei
DOI
zh-TW
Abstract
A reservoir goal linear programming model, its dual model and the relations among the two are introduced with simple examples. The three functional services of the reservoir considered are: reserved space for flood control, water supply, and pooling of water. The reservoir is to be operated to meet the minimum demands for each service item in each period. The profit for each service is a piecewise linear of the supply and their total profit from all service items is to be maximized or minimized.
First, potential network simplex was offered to solve reservoir problem. Then, flow network dual simplex was used to solve the dual problem. The key concepts of the two models and their simplex network algorithms are itemized in tables and compared for the duality.
Subjects
多功能水庫
水庫標的線性規劃模式
對偶問題
單純形法
Multi-functional reservoir
Reservoir goal linear programming model
Dual problem
Potential network simplex
Flow network dual simplex
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-94-R92622032-1.pdf
Size
23.53 KB
Format
Adobe PDF
Checksum
(MD5):d2fb6cce8abe36256232d1038508c47a