X - UWSpace - University of Waterloo
X - UWSpace - University of Waterloo
X - UWSpace - University of Waterloo
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Effichcius for FP<br />
Figure 5.8 Efficiencies for FP with Simplex and Barrier<br />
In some large problems. the parallel primai-dual decomposition showed some<br />
encouragng test results. however much more testing and development as well as efficient coding<br />
schemes are needed.<br />
For the heuristic metho& experiments were done at the very early stage <strong>of</strong> this research.<br />
and we have only the records <strong>of</strong> TEP and NAEP test ~sults. The tests were done with seved<br />
different data sets and they showed that the heuristic algorithm did not always converge to an<br />
optimal solution <strong>of</strong> the original pmblem. When it did not converge, it repeated the sarne upper<br />
bounds and lower bounds <strong>of</strong> the orignal problem for three consecutive iteraaons and the ddity<br />
cap =as between 0.5 5% and 9 % in those test problems.<br />
C