| dc.contributor | 應數系 | en_US |
| dc.creator (作者) | 陸行 | zh_TW |
| dc.creator (作者) | Luh,Hsing | en_US |
| dc.creator (作者) | Lee,Ming-Chang | en_US |
| dc.creator (作者) | Lyu,JrJung | en_US |
| dc.date (日期) | 2004 | en_US |
| dc.date.accessioned | 5-Aug-2014 17:33:41 (UTC+8) | - |
| dc.date.available | 5-Aug-2014 17:33:41 (UTC+8) | - |
| dc.date.issued (上傳時間) | 5-Aug-2014 17:33:41 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/68193 | - |
| dc.description.abstract (摘要) | 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. | - |
| dc.format.extent | 115 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | American Journal of Applied Sciences,1(2),90-94 | en_US |
| dc.title (題名) | Solving Linear Programming Problems on the Parallel Virtual Machine Environment | en_US |
| dc.type (資料類型) | article | en |
