This paper presents a serial decomposition algorithm for the solution of the static single commodity spatial price equilibrium problem. The computational performance of this algorithm on randomly generated examples suggests that this method is more efficient and requires no more computer storage than other algorithms previously suggested for this problem.