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

Anna Nagurney and Alexander Eydeland
Additional contact information
Anna Nagurney: University of Massachusetts, Amherst, Massachusetts 01003
Alexander Eydeland: University of Massachusetts, Amherst, Massachusetts 01003

Transportation Science, 1992, vol. 26, issue 1, 59-68

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.

Date: 1992
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.26.1.59 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:26:y:1992:i:1:p:59-68

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().