Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Polito et al. (1980) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: