X - UWSpace - University of Waterloo

one upper bound subproblem.
The algorithm proceeds to solve ail the subproblems simultaneously and broadcasts
prima1 information (proposais) to the lower bound subproblems and duai information (cuts) 10
the upper bound subproblems. After ail the lower bound subproblems receive pnmal information
and ail the upper bound subproblems receive duai information from other subproblems. the
algorithm solves ail the subproblems simultaneousl y again. This procedm continues until the
algorithm satisfies some stopping criteria. Figure 1.3 shows the communication scheme between
subproblems mentioned sbove. for the case of a five part LP having the lower bounding
subproblems and two upper bounding subproblems. Note that there could be various assignments
of subproblem type (lower. upper) to pan number are possible. Figure 4.3 illustrates one
possibility.
Figure 4.3 Information Bows for the heuristic parailel decomposition algondun
75