Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/18842| 題名: | Performance Analysis of a Parallel Dantzig-Wolfe Decomposition Algorithm for Linear Programming | 作者: | Luh,Hsing 陸行 Lee,Ming-Chang Lyu,Jung Jr |
貢獻者: | 應數系 | 關鍵詞: | Linear programming; Decomposition algorithms; Parallel processing | 日期: | Nov-2002 | 上傳時間: | 24-Dec-2008 | 摘要: | This paper employs the Dantzig-Wolfe decomposition principle to solve linear programming models in a parallel-computing environment. Adopting the queuing discipline, we showed that under very general conditions, the proposed algorithm speedup trends toward a limiting value as the number of processors increases. | 關聯: | Computers and Mathematics with Applications,44(10),1431-1437 | 資料類型: | article |
| Appears in Collections: | 期刊論文 |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 1431-1437.pdf | 461.44 kB | Adobe PDF2 | View/Open |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.