A review of the parallel standard, dual and modified Simplex methods for solving the LP problems

So far, several methods have been introduced to solve linear problems, one of them is the Simplex method that is one of the most important and widely used solutions for linear programming problems (LP). There are two types of Simplex methods: the first is the modified method and the second is the standard or tabular method. With the increasing use of computers for research work, the need for faster processing has increased and has become a basic need. Today, parallel processing has solved a very large part of this requirement. Parallel processing or parallel computing is defined as Simultaneous execution of programs that are divided into smaller sections on multiple processors to make greater speed. In this paper, first, a brief description of the main concepts of the article is given, then we overview the methods used in various articles to parallelize the standard, dual and modified Simplex method in solving LP problems

Keywords:

Parallel computing , simplex method , message passing interface , CUDA , Open Multi-Processing