Parallel computation of intertemporal multicommodity spatial price equilibria in the presence of quotas
From MaRDI portal
An intertemporal, spatial price equilibrium is determined for multiple commodities where the net import of each commodity in a given time period is a linear function of the prices of all commodities in that region and time period. Temporal and spatial flows are subject to fixed unit costs, and quotas in the form of upper bounds. A parallel decomposition scheme exploits characteristics of equilibria.
Recommendations
- The formulation and solution of large-scale multi-commodity equilibrium problems over space and time
- Massively parallel computation of large-scale spatial price equilibrium models with discriminatory ad valorem tariffs
- Massively parallel computation of spatial price equilibrium problems as dynamical systems
- Parallel and Serial Successive Overrelaxation for Multicommodity Spatial Price Equilibrium Problems
- Parallel computation of large-scale dynamic market network equilibria via time period decomposition
Cites work
- A general dynamic spatial price equilibrium model: Formulation, solution, and computational results
- A general dynamic spatial price network equilibrium model with gains and losses
- A Hybrid Method for the Solution of Some Multi-Commodity Spatial Equilibrium Problems
- A network formulation of market equilibrium problems and variational inequalities
- A Newton-SOR Method for Spatial Price Equilibrium
- A parametric linear complementarity technique for the computation of equilibrium prices in a single commodity spatial model
- A variable-dimension homotopy on networks for computing linear spatial equilibria
- Alternative Models of Spatial Competition
- An algorithm for the classical spatial price equilibrium problem
- An Effective Decomposition Procedure for Computing Equilibrium Single Commodity Trade Flows
- An iterative SOR algorithm for multi-period spatial equilibria
- Computational Experience in Solving Equilibrium Models by a Sequence of Linear Complementarity Problems
- Computing Economic Equilibria on Affine Networks with Lemke's Algorithm
- Computing Equilibrium Single Commodity Trade Flows Using Successive Overrelaxation
- Equilibrium among Spatially Separated Markets: Solution by Electric Analogue
- Multi-sweep asynchronous parallel successive overrelaxation for the nonsymmetric linear complementarity problem
- Pairwise reactive SOR algorithm for quadratic programming of net import spatial equilibrium models
- Parallel and Serial Successive Overrelaxation for Multicommodity Spatial Price Equilibrium Problems
- Parallel computation of large-scale dynamic market network equilibria via time period decomposition
- Probability, Utility, and the Independence Axiom
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- Solution of symmetric linear complementarity problems by iterative methods
- Sparsity-preserving SOR algorithms for separable quadratic and linear programming
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
Cited in
(6)- A microcomputer-based implementation of the expanding equilibrium algorithm for linear, single commodity spatial price equilibrium problems
- Parallel computation of large-scale dynamic market network equilibria via time period decomposition
- Massively parallel computation of spatial price equilibrium problems as dynamical systems
- The formulation and solution of large-scale multi-commodity equilibrium problems over space and time
- Massively parallel computation of large-scale spatial price equilibrium models with discriminatory ad valorem tariffs
- Parallel algorithm for calculating general equilibrium in multiregion economic growth models
This page was built for publication: Parallel computation of intertemporal multicommodity spatial price equilibria in the presence of quotas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1308670)
