Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/68193
題名: | Solving Linear Programming Problems on the Parallel Virtual Machine Environment | 作者: | 陸行 Luh,Hsing Lee,Ming-Chang Lyu,JrJung |
貢獻者: | 應數系 | 日期: | 2004 | 上傳時間: | 5-八月-2014 | 摘要: | This study developed a parallel algorithm to efficiently solve linear programming models. The proposed algorithm utilizes the Dantzig-Wolfe Decomposition Principle and can be easily implemented in a general distributed computing environment. The analytical performance of the well-known method; including the speedup upper bound and lower bound limits; was derived. Numerical experiments are also provided in order to verify the complexity of the proposed algorithm. The empirical results demonstrate that the speedup of this parallel algorithm approaches linearity; which means that it can take full advantage of the distributed computing power as the size of the problem increases. | 關聯: | American Journal of Applied Sciences,1(2),90-94 | 資料類型: | article |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
index.html | 115 B | HTML2 | View/Open |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.