An iterative SOR algorithm for multi-period spatial equilibria

DOI10.1016/0377-2217(92)90359-HzbMath0757.90062MaRDI QIDQ1194716

Faruk Güder

Publication date: 6 October 1992

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

successive overrelaxationsparse networkmulti-period spatial equilibrium

Mathematics Subject Classification ID

Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

Parallel computation of intertemporal multicommodity spatial price equilibria in the presence of quotas

Cites Work

• A network formulation of market equilibrium problems and variational inequalities
• A variable-dimension homotopy on networks for computing linear spatial equilibria
• Sparsity-preserving SOR algorithms for separable quadratic and linear programming
• Gauss-Seidel-Newton-Armijo approach for minimization problems on the non- negative orthant. Application to spatial price equilibrium problems
• Alternative Models of Spatial Competition
• Computing Equilibrium Single Commodity Trade Flows Using Successive Overrelaxation
• An Effective Decomposition Procedure for Computing Equilibrium Single Commodity Trade Flows
• A general dynamic spatial price network equilibrium model with gains and losses
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation

This page was built for publication: An iterative SOR algorithm for multi-period spatial equilibria