An Iterative LP Algorithm for Quadratic Spatial Equilibria
提出一种基于Benders分解的分区算法，将净进口空间均衡模型分解为线性主问题和二次子问题，利用线性规划软件迭代求解。
This paper describes a partitioning algorithm based on the Benders decomposition to solve net import spatial equilibrium models. The method decomposes the problem into a linear master problem and a quadratic subproblem. It is shown that the quadratic subproblem is trivial, and the associated dual variables can be determined through ordinary calculus. Therefore, the quadratic spatial equilibrium problem is solved iteratively by using linear programming software.