TY - JOUR
T1 - Performance analysis of a parallel Dantzig-Wolfe decomposition algorithm for linear programming
AU - Lyu, Jr Jung
AU - Luh, Hsing
AU - Lee, Ming Chang
PY - 2002/11
Y1 - 2002/11
N2 - This paper employs the Dantzig-Wolfe decomposition principle to solve linear programming models in a parallel-computing environment. Adopting the queuing discipline, we showed that under very general conditions, the proposed algorithm speedup trends toward a limiting value as the number of processors increases.
AB - This paper employs the Dantzig-Wolfe decomposition principle to solve linear programming models in a parallel-computing environment. Adopting the queuing discipline, we showed that under very general conditions, the proposed algorithm speedup trends toward a limiting value as the number of processors increases.
UR - http://www.scopus.com/inward/record.url?scp=0036857096&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0036857096&partnerID=8YFLogxK
U2 - 10.1016/S0898-1221(02)00267-5
DO - 10.1016/S0898-1221(02)00267-5
M3 - Article
AN - SCOPUS:0036857096
SN - 0898-1221
VL - 44
SP - 1431
EP - 1437
JO - Computers and Mathematics with Applications
JF - Computers and Mathematics with Applications
IS - 10-11
ER -