Application Of A Self-Dual Parametric Algorithm In The Reservoir Goal Linear Programming Problem
Date Issued
2005
Date
2005
Author(s)
Lin, Sheng-Hsien
DOI
zh-TW
Abstract
A reservoir goal linear programming model was formulated for a simple reservoir in this thesis. It can be treated as a potential network model. The dual model of potential network is a network flow problem. 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 minimum demands for each service item in each period. The profit for each service item is a piecewise linear function of supply and the total profit is to be maximized. In this thesis, self-dual parametric algorithm were presented for solving the reservoir and its dual problems.
The network simplex, network dual simplex, and complimentary theorem were used to solve reservoir and its dual problems. First, self-dual parametric algorithm, network simplex, and network dual simplex were offered to solve reservoir problem. Then, complimentary theorem were used to solve the dual problem.
Subjects
水庫標的線性規劃問題
對偶問題
位勢網絡
流量網絡
網絡單純形法
對偶網絡單純形法
自對偶參數法
互補定理
reservoir goal linear programming problem
dual problem
potential network problem
network flow problem
network simplex
network dual simplex
self-dual parametric algorithm
complimentary theorem
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-94-R92622033-1.pdf
Size
23.53 KB
Format
Adobe PDF
Checksum
(MD5):eff3275ec87761bac5ce06ccc1b76dd3