X - UWSpace - University of Waterloo

Due to some difficulties in coding and time limits. we could not develop the parallel
decomposition solver for more than 4 parts. However. it should be extended to handle any number
of parts. This could be done with more advanced coding techniques such as the object oriented
programming pandigrn. ui its current fonn, the parallel decomposition solver does not calculate
optimal prima1 and dual vectors. To be of practicai use to modellen, these should be calculated
and sent back to GAMS to allow genention of a solution report. Implementing the parallel
algorithm among physically disvibuted computen with local databases for locally developed
subproblerns and cornmunicatirtg with one another by emails or web bmwsea would be another
interesting subject from a practicai point of view.
Needless to say, more testing and implernentations are required to assess the efficiency
of the panllel decomposition algorithm for various sized and structured problems.