An Efficient Steepest-Edge Simplex Algorithm for SIMD Computers

@inproceedings{Thomadakis1996AnES,
  title={An Efficient Steepest-Edge Simplex Algorithm for SIMD Computers},
  author={Michael E. Thomadakis and Jyh-Charn Liu},
  booktitle={International Conference on Supercomputing},
  year={1996}
}
This paper proposes a new parallelization of the Primal and Dual Simplex algorithms for Linear Programming (LP) problems on massively parallel Single-Instruction Multiple-Data (SIMD) computers. The algorithms are based on the Steepest-Edge pivot selection method and the tableau representation of the constraint matrix. The initial canonical tableau is formed on an attached scalar host unit, and then partitioned into a rectangular grid of sub-matrices and distributed to the individual Processor… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 16 CITATIONS

Efficient GPU-based implementations of simplex type algorithms

  • Applied Mathematics and Computation
  • 2015
VIEW 1 EXCERPT
CITES METHODS

GPU accelerated pivoting rules for the simplex algorithm

  • Journal of Systems and Software
  • 2014
VIEW 1 EXCERPT
CITES METHODS

A Branch-and-Bound algorithm using multiple GPU-based LP solvers

  • 20th Annual International Conference on High Performance Computing
  • 2013
VIEW 1 EXCERPT
CITES METHODS

References

Publications referenced by this paper.
SHOWING 1-3 OF 3 REFERENCES

Parallel Implementation of Sparse Simplex Algorithm," Manuscript, Dept. of Computer Science

Shu, Wei
  • SUNY at Bu alo,
  • 1994
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers