Solution of Spatial Equilibrium Problems with Benders Decomposition

Spatial equilibrium problems are frequently formulated as large scale quadratic programming problems or linear complementarity problems. We show that these problems can be reduced to two or more smaller problems with Generalized Benders Decomposition. The procedure then becomes iterative with the repetitive solution of the smaller problems. In practice, the iterative procedure has converged rapidly.