An Implementation of a Parallel Primal-Dual Interior Point Method for Multicommodity Flow Problems

Simple item page
dc.contributor.authorLi, Guangye
dc.contributor.authorLustig, Irvin J.
dc.date.accessioned2018-06-18T17:39:38Z
dc.date.available2018-06-18T17:39:38Z
dc.date.issued1992-01
dc.date.noteJanuary 1992
dc.description.abstractAn implementation of the primal-dual predictor-corrector interior point method is specialized to solve linear multicommodity flow problems. The block structure of the constraint matrix is exploited via parallel computation. The bundling constraints require the Cholesky factorization of a dense matrix, where a method that exploits parallelism for the dense Cholesky factorization is used. The resulting implementation is 65 to 90 percent efficient, depending on the problem instance. For a problem with K commodities, an approximate speedup for the interior point method of 0.8K is realized.
dc.format.extent24 pp
dc.identifier.citationLi, Guangye and Lustig, Irvin J.. "An Implementation of a Parallel Primal-Dual Interior Point Method for Multicommodity Flow Problems." (1992) <a href="https://hdl.handle.net/1911/101742">https://hdl.handle.net/1911/101742</a>.
dc.identifier.digitalTR92-02
dc.identifier.urihttps://hdl.handle.net/1911/101742
dc.language.isoeng
dc.titleAn Implementation of a Parallel Primal-Dual Interior Point Method for Multicommodity Flow Problems
dc.typeTechnical report
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR92-02.pdf
Size:
345.05 KB
Format:
Adobe Portable Document Format
Download
Collections
CAAM Technical Reports