A Study of Interval linear Programming and Network Programming

• Main Authors: Li, Jr-Shin, 李智新
• Other Authors: Chia-Ming Liu
• Format: Others
• Language: zh-TW
• Published: 1998
• Online Access: http://ndltd.ncl.edu.tw/handle/10709149944390548072

碩士 === 國立臺灣大學 === 農業工程學系研究所 === 86 === Traditional linear programming models contain only constant objective, constra int, and right-hand-side coefficients. However, there exist many patterns of u ncertainty in water resources systems and these uncertainties cannot be fully incorporated in the optimization framework if represented by deterministic par ameters. In this study, interval number linear programming and grey linear pro gramming algorithms are examined, in which interval numbers are used to descri be uncertain system parameters, and applied to reservoir capacity planning pro blems. Comparisons of these two approaches are addressed. The concepts of Inte rval Number Linear Programming are added to Network Programming for reservoir planning problem. The Interval Number Network Programming which can evaluate t he best and worst solutions is different from traditional method which can be only applied to deterministic problems. In this study, a simplified example of reservoir planning problem is first formulated as a network programming model and solved by the minimum cut set algorithm. Then, concepts of interval numbe r linear programming are added to the network programming model for the reserv oir planning problem. With the modifications, the ability of network programmi ng model are enhanced to deal with uncertainty. This study provides alternativ e algorithms for linear programming dealing with water resources systems conta ining uncertain parameters.