## Abstract

This paper presents an application of parallel computing techniques to the solution of an important class of planning problems known as generalized networks. Three parallel primal simplex variants for solving generalized network problems are presented. Data structures used in a sequential generalized network code are briefly discussed and their extension to a parallel implementation of one of the primal simplex variants is given. Computational testing of the sequential and parallel codes, both written in Fortran, was done on the CRYSTAL multicomputer at the University of Wisconsin, and the computational results are presented. Maximum efficiency occurred for multiperiod generalized network problems where a speedup approximately linear in the number of processors was achieved.

Original language | English |
---|---|

Pages (from-to) | 125-145 |

Number of pages | 21 |

Journal | Annals of Operations Research |

Volume | 14 |

Issue number | 1 |

DOIs | |

State | Published - Dec 1988 |

## ASJC Scopus subject areas

- General Decision Sciences
- Management Science and Operations Research