X - UWSpace - University of Waterloo

LIST OF FIGURES
Figure 1.1 Structures of multi-stage problem. h m Lm and Fuller [ 19951 ........................ (1)
Figure 1.2 General structure of the multi-part models ....................................................... (4)
Figure 2.1 information fiow of nested primal-dual decornposition .................................. (12)
Figure 3.1 Information Row for panllel two-part algorithm .................................... . .. (26)
Figure 4.1 The bifurcation process for N=9 (9-parts) ...................................................... (48)
Figure 4.2 +part decornposition principle and information fiow ..................................... (50)
Figure 4.3 Bstage decomposition principle in Lan-Fuller method ................................... (53)
Figure 1.4 Information flow of +stage decomposition in Lm's method .......................... (61)
Figure 1.5 Information flows for the heunsiic parallel decomposi tion algorithm ............ (75)
Figure 5.1 Network connectivity ....................................................................................... (88)
Figure 5.1 Exmple of GAMS mode1 fomulation ............................................................ (90)
Figure 5.3 Example of SET file ......................................................................................... (91)
Figure 5.4 Example of anonymous mauix generated by GAMS ...................................... (92)
Figure 5.5 Example of multi-part structure generated by WSET ...................................... (93)
Figure 5.6 A scenario me for HEPGl .............................................................................. (97)
Figure 5.7 Speedups for FP with Simplex and Banier ................................................ ( 105)
................................................
Figure 5.8 Efficiencies for FP with Simplex and Barrier (106)