| publication name | Badr, E., Moussa M., Paparrizos, K., Samaras, N. (2006) "Some Computational results on MPI Parallel Implementation of Dense Simplex Method". In Proc. of World Academy of Science, Engineering and Technology (PWASET), Vol. 23, pp. 39-42, (presented in the Seventeenth International Conference on Computer & Information Science and Engineering ( CISE 2006), 8-10 December, Cairo, Egypt, 2006. |
|---|---|
| Authors | E.M. Badr, Moussa M., Paparrizos, K., Samaras, N. |
| year | 2006 |
| keywords | |
| journal | |
| volume | Not Available |
| issue | Not Available |
| pages | Not Available |
| publisher | Not Available |
| Local/International | International |
| Paper Link | Not Available |
| Full paper | download |
| Supplementary materials | Not Available |
Abstract
There are two major variants of the Simplex Algorithm: the revised method and the standard, or tableau method. Today, all serious implementations are based on the revised method because it is more efficient for sparse linear programming problems. Moreover, there are a number of applications that lead to dense linear problems so our aim in this paper is to present some computational results on parallel implementation of dense Simplex Method. Our implementation is implemented on a SMP cluster using C programming language and the Message Passing Interface MPI. Preliminary computational results on randomly generated dense linear programs support our results.