Skip to main content
Article thumbnail
Location of Repository

Solving Linear Programming Problems on the Parallel Virtual Machine Environment

By JrJung Lyu, Hsing Luh and Ming-Chang Lee

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

Topics: </keyword><keyword>Linear Programming, Methodology, LCC:General Works, LCC:A, DOAJ:Multidisciplinary, DOAJ:General Works
Publisher: Science Publications
Year: 2004
DOI identifier: 10.3844/ajassp.2004.90.94
OAI identifier: oai:doaj.org/article:e8e9dcdd56d5402ebe0b17016eddcc54
Journal:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://doaj.org/search?source=... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.