Please use this identifier to cite or link to this item:
https://ah.nccu.edu.tw/handle/140.119/18842
|
| Title: | Performance Analysis of a Parallel Dantzig-Wolfe Decomposition Algorithm for Linear Programming |
| Authors: | Luh,Hsing 陸行 Lee,Ming-Chang Lyu,Jung Jr |
| Contributors: | 應數系 |
| Keywords: | Linear programming;Decomposition algorithms;Parallel processing |
| Date: | 2002-11 |
| Issue Date: | 2008-12-24 13:39:02 (UTC+8) |
| Abstract: | 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. |
| Relation: | Computers and Mathematics with Applications,44(10),1431-1437 |
| Data Type: | article |
| Appears in Collections: | [應用數學系] 期刊論文 |
Files in This Item:
|
All items in 學術集成 are protected by copyright, with all rights reserved.
| 社群 sharing |