Solving Linear Programming Problems on the Parallel Virtual Machine Environment | Science Publications

American Journal of Applied Sciences

JrJung Lyu¹  Hsing Luh¹  Ming-Chang Lee¹ 

关键词: Linear Programming;    Methodology;   

DOI  :  10.3844/ajassp.2004.90.94

学科分类：自然科学（综合）

来源: Science Publications

【 摘 要 】

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.

【 授权许可】

Unknown