Towards a practical parallelisation of the simplex method

J. A. J. Hall
2008 Computational Management Science  
The simplex method is frequently the most efficient method of solving linear programming (LP) problems. This paper reviews previous attempts to parallelise the simplex method in relation to efficient serial simplex techniques and the nature of practical LP problems. For the major challenge of solving general large sparse LP problems, there has been no parallelisation of the simplex method that offers significantly improved performance over a good serial implementation. However, there has been
more » ... me success in developing parallel solvers for LPs that are dense or have particular structural properties. As an outcome of the review, this paper identifies scope for future work towards the goal of developing parallel implementations of the simplex method that are of practical value.
doi:10.1007/s10287-008-0080-5 fatcat:7rdsk7ic7bca7dy5e6yvybuioq