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.
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.
This is a preview of subscription content, log in to check access.
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
Maros, I., Mitra, G.: Investigating the Sparse Simplex Algorithm On a Distributed Memory Multiprocessor. Parallel Computing 26, 151–170 (2000)MATHCrossRefGoogle Scholar