Research Article Open Access

Solving Linear Programming Problems on the Parallel Virtual Machine Environment

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.

American Journal of Applied Sciences
Volume 1 No. 2, 2004, 90-94

DOI: https://doi.org/10.3844/ajassp.2004.90.94

Submitted On: 13 March 2005 Published On: 30 June 2004

How to Cite: Lyu, J., Luh, H. & Lee, M. (2004). Solving Linear Programming Problems on the Parallel Virtual Machine Environment. American Journal of Applied Sciences, 1(2), 90-94. https://doi.org/10.3844/ajassp.2004.90.94

  • 2,563 Views
  • 1,702 Downloads
  • 3 Citations

Download

Keywords

  • Linear Programming
  • Methodology