Location of Repository

Some Computational Results on MPI Parallel Implementation of Dense Simplex Method

By El-said Badr, Mahmoud Moussa, Konstantinos Paparrizos, Nikolaos Samaras and Angelo Sifaleras

Abstract

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

Topics: Simplex Algorithm
Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.193.5070
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.waset.org/journals/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.