IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v26y1992i1p59-68.html
   My bibliography  Save this article

A Parallel Network Equilibration Algorithm for a Class of Constrained Matrix Problems

Author

Listed:
  • Anna Nagurney

    (University of Massachusetts, Amherst, Massachusetts 01003)

  • Alexander Eydeland

    (University of Massachusetts, Amherst, Massachusetts 01003)

Abstract

In this paper we propose a network equilibration algorithm for the solution of a class of constrained matrix problems with transportation-type constraints. The algorithm decomposes the problem into two series of supply and demand network equilibrium problems with special structure which can then be solved exactly and in parallel. The theoretical results obtained include the proof of convergence, the rate of convergence, and computational complexity analysis, and are obtained by interpreting the algorithm as a dual method. Computational results on datasets illustrate the theory and the efficiency of this approach.

Suggested Citation

  • Anna Nagurney & Alexander Eydeland, 1992. "A Parallel Network Equilibration Algorithm for a Class of Constrained Matrix Problems," Transportation Science, INFORMS, vol. 26(1), pages 59-68, February.
    • Handle: RePEc:inm:ortrsc:v:26:y:1992:i:1:p:59-68
    DOI: 10.1287/trsc.26.1.59
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.26.1.59
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.26.1.59?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:inm:ortrsc:v:26:y:1992:i:1:p:59-68. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.