A hybrid algorithm for the solution of a single commodity spatial equilibrium model

DOI10.1016/0305-0548(95)00072-0zbMath0854.90136OpenAlexW2055095607MaRDI QIDQ1919772

Luis F. Portugal, Joaquim Joao Júdice

Publication date: 19 January 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(95)00072-0

zbMATH Keywords

linear complementarityhybrid algorithmpredictor-correctorlarge-scale single commodity spatial equilibrium modellarge-scale spatial equilibriumparametric principal pivoting

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Spatial models in sociology (91D25)

Uses Software

• PDNET

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A new polynomial-time algorithm for linear programming
• Solution of sparse linear least squares problems using Givens rotations
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems
• Network economics: a variational inequality approach
• A parametric linear complementarity technique for the computation of equilibrium prices in a single commodity spatial model
• Computing Economic Equilibria on Affine Networks with Lemke's Algorithm
• A Hybrid Method for the Solution of Some Multi-Commodity Spatial Equilibrium Problems
• Parallel and Serial Successive Overrelaxation for Multicommodity Spatial Price Equilibrium Problems
• On the Implementation of a Primal-Dual Interior Point Method
• A quadratic network optimization model for equilibrium single commodity trade flows
• Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives
• A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables
• An Investigation of Interior-Point Algorithms for the Linear Transportation Problem
• A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming
• Methods of conjugate gradients for solving linear systems

This page was built for publication: A hybrid algorithm for the solution of a single commodity spatial equilibrium model