Alternative Implementations of Expanding Algorithm for Multi-Commodity Spatial Price Equilibrium.
Abstract
This thesis presents an algorithm based on the expanding algorithm to solve spatial price equilibrium problems for three different models: perfect competition, monopoly, oligopoly. The expanding algorithm is used to solve the linear single commodity spatial price equilibrium problem for perfectly competitive markets. In this thesis, we consider the general multi-commodity spatial price equilibrium problems with all nonlinear functions, and variable shipping cost. We also show that more commodities in total are shipped, and there is more congestion, especially in oligopoly model.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1997
- Accession Number
- ADA324153
Entities
People
- Yu-shen Ke
Organizations
- Air Force Institute of Technology