On the efficacy of distributed simplex algorithms for linear programming

We consider the use of distributed computation to solve general unstructured linear programs by the inherently serial approach of the simplex method. Timing models for the distributed algorithms are presented to predict results which are then verified empirically. Our results contribute to the identification of all viable exploitations of distributed computing which is likely to become a prevalent environment.Dedicated to Professor George B. Dantzig on the occasion of his eightieth birthday.