IDEAS home Printed from https://ideas.repec.org/p/cor/louvco/1998008.html
   My bibliography  Save this paper

A parallel interior-point algorithm for linear programming on a shared memory machine

Author

Listed:
  • ANDERSEN, Erling D.

    (Department of Management, Odense University, Odense)

  • ANDERSEN, Knud D.

    (Center for Operations Research and Econometrics (CORE), Université catholique de Louvain (UCL), Louvain la Neuve, Belgium)

Abstract

The XPRESS interior point optimizer is an “industrial strength” code for solution of large-scale sparse linear programs. The purpose of the present paper is to discuss how the XPRESS interior point optimizer has been parallelized for a Silicon Graphics multi processor computer. The ma jor computational task, performed in each iteration of the interior-point method implemented in the XPRESS interior point optimizer is the solution of a symmetric and positive definite system of linear equations. Therefore, parallelization of the Cholesky decomposition and the triangular solve procedure are discussed in detail. Finally, computational results are presented to demonstrate the parallel efficiency of the optimizer. It should be emphasized that the methods discussed can be applied to the solution of large-scale sparse linear least squares problems

Suggested Citation

  • ANDERSEN, Erling D. & ANDERSEN, Knud D., 1998. "A parallel interior-point algorithm for linear programming on a shared memory machine," LIDAM Discussion Papers CORE 1998008, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvco:1998008
    as

    Download full text from publisher

    File URL: https://sites.uclouvain.be/core/publications/coredp/coredp1998.html
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cor:louvco:1998008. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.