Projected dynamical systems modeling and computation of spatial network equilibria
Authors:
Abstract
In this paper, we consider the price formulation—rather than the quantity formulation—of spatial network equilibria and introduce a projected dynamical system, whose set of stationary points corresponds to the set of solutions of the governing variational inequality problem. We then interpret the dynamical system as a tatonnement process in which the commodity prices and shipments are updated simultaneously. We propose an Euler‐type method for the computation of the commodity prices and trade patterns, provide convergence results, and demonstrate that the algorithm can be implemented on massively parallel architectures. The notable feature of the algorithm is that the prices and shipments can be computed independently and in closed form. Finally, we illustrate the performance of the implemented algorithm on the Thinking Machine's CM‐2 and CM‐5 architectures.Keywords
This publication has 23 references indexed in Scilit:
- Massively parallel computation of spatial price equilibrium problems as dynamical systemsJournal of Economic Dynamics and Control, 1995
- Dynamical systems and variational inequalitiesAnnals of Operations Research, 1993
- A general dynamic spatial price network equilibrium model with gains and lossesNetworks, 1989
- ALTERNATIVE ALGORITHMS FOR THE GENERAL NETWORK SPATIAL PRICE EQUILIBRIUM PROBLEM*Journal of Regional Science, 1984
- SOLUTION OF THE GENERAL MULTICOMMODITY SPATIAL EQUILIBRIUM PROBLEM BY VARIATIONAL AND COMPLEMENTARITY METHODS*Journal of Regional Science, 1984
- A solution condition for complementarity problems: with an application to spatial price equilibriumApplied Mathematics and Computation, 1984
- A new look at static spatial price equilibrium modelsRegional Science and Urban Economics, 1982
- On the Goldstein-Levitin-Polyak gradient projection methodIEEE Transactions on Automatic Control, 1976
- Minimization of functions having Lipschitz continuous first partial derivativesPacific Journal of Mathematics, 1966
- Convex programming in Hilbert spaceBulletin of the American Mathematical Society, 1964