LINEAR-PROGRAMMING ON TRANSPUTERS

This paper describes a parallel implementation of the revised simplex algorithm, by applying the explicit form of the basis inverse. Test results are demonstrated experimentally by running this parallel version of the algorithm on a number of networks of transputers. High speedup can be achieved provided that the number of transputers in the network is much less than the problem's dimension. In addition, there is also a brief discussion about parallel implementations of the interior point methods.