A high performance dual revised simplex solver

Julian Hall, Qi Huangfu

Research output: Contribution to journalArticlepeer-review

Abstract

When solving families of related linear programming (LP) problems and many classes of single LP problems, the simplex method is the preferred computational technique. Hitherto there has been no efficient parallel implementation of the simplex method that gives good speed-up on general, large sparse LP problems. This paper presents a variant of the dual simplex method and a prototype parallelisation scheme. The resulting implementation, ParISS, is efficient when run in serial and offers modest speed-up for a range of LP test problems.
Original languageEnglish
Pages (from-to)143-151
Number of pages9
JournalLecture Notes in Computer Science
Volume7203
Publication statusPublished - 2012

Keywords

  • Linear programming, Dual revised simplex method, Parallel algorithms

Fingerprint

Dive into the research topics of 'A high performance dual revised simplex solver'. Together they form a unique fingerprint.

Cite this