Please use this identifier to cite or link to this item:
|Title:||Solving Linear Programming Problems on the Parallel Virtual Machine Environment|
|Issue Date:||2014-08-05 17:33:41 (UTC+8)|
|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.|
|Relation:||American Journal of Applied Sciences,1(2),90-94|
|Appears in Collections:||[應用數學系] 期刊論文|
Files in This Item:
All items in 學術集成 are protected by copyright, with all rights reserved.