X - UWSpace - University of Waterloo
X - UWSpace - University of Waterloo
X - UWSpace - University of Waterloo
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
the second subproblem to make a cut and the pnmal solutions <strong>of</strong> the second<br />
subproblem are passed to the fint subproblern as the proposal information.<br />
5. The new aigorithm approximates the objective function value by issuing<br />
monotonicaily improved lower bounds and upper bounds by the first subproblem and<br />
second subproblem. respectively during the iterations.<br />
6. This algorithm performs the convergence test by refemng to both subproblems<br />
simultaneously and converges to a given tolerance in a finite number <strong>of</strong> steps.<br />
-<br />
7. If, in the upper bounding subproblern. spf. al1 cuts except the most ment are<br />
eli minated, then the algori thm reduces to the familiar Dantzig- Wolfe decomposition<br />
algori thm.<br />
8. K. in the lower bounding subproblern. SP:, - the weight on the most recent proposd is<br />
required to equal 1 (and the other weights are zero). then the algorithm reduces to the<br />
fmi liv Benders decomposition algorithm.<br />
9. The panllel decomposition algorithm cm be extended to more than two part<br />
problems. Chapter 4 discusses a padlel algorithm for the multi-part problems.