Advertisement

A New Efficient Parallel Revised Relaxation Algorithm

  • Jianjun Zhang
  • Qinghua Li
  • Yexin Song
  • Yong Qu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4113)

Abstract

The relaxation algorithm for linear programming is revised in this paper. Based on cluster structure, a parallel revised algorithm is presented. Its performance is analyzed. The experimental results on DAWNING 3000 are also given. Theoretical analysis and experimental results show that the revised relaxation algorithm improves the performance of the relaxation algorithm, and it has good parallelism and is very robust. Therefore, it can expect to be applied to the solution of the large-scale linear programming problems rising from practical application.

Keywords

Parallel Algorithm Linear Programming Problem Master Process Relaxation Problem Relaxation Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Papadimitrious, C.H., Steiglitz, K.: Combinatorial Optimization. Algorithms and Complexity (1992)Google Scholar
  2. 2.
    Lyu, J., Luh, H., Lee, M.: Performance Analysis Of A Parallel Dantzig-Wolfe Decomposition Algorithm for Linear Programming. Computers and Mathematics with Applications 44, 1431–1437 (2002)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Maros, I., Mitra, G.: Investigating the Sparse Simplex Algorithm On a Distributed Memory Multiprocessor. Parallel Computing 26, 151–170 (2000)MATHCrossRefGoogle Scholar
  4. 4.
    Klabjan, D., Johnson, E., Nemhauser, G.: A Parallel Primal-dual Simplex Algorithm. Operation Research Letters 27, 47–55 (2000)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Johnson, H.E.: Computational Results with a Primal-dual Sub problem Simplex Method. Operation Research Letter 25, 149–158 (1999)MATHCrossRefGoogle Scholar
  6. 6.
    Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)MATHGoogle Scholar
  7. 7.
    Gay, D.M.: E1ectronic Mail Distribution of Linear Programming Test Problems. Mathematical Programming Society COAL Newsletter 13, 10–12 (1985)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jianjun Zhang
    • 1
    • 2
  • Qinghua Li
    • 1
  • Yexin Song
    • 2
  • Yong Qu
    • 2
  1. 1.Department of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhanChina
  2. 2.College of ScienceNaval University of EngineeringWuhanChina

Personalised recommendations