作者: Kerry Litzenberg , Bruce A. McCarl , Joe Polito
DOI: 10.2307/1240657
关键词: Reactive programming 、 Decomposition (computer science) 、 Quadratic programming 、 Equilibrium point 、 Applied mathematics 、 Supply and demand 、 Mathematics 、 Convergence (routing) 、 Spatial equilibrium
摘要: Spatial equilibrium analysis in agricultural economics has received considerable attention the past several years (Takayama and Judge 1971; Takayama; Weinschenck, Henrichsmeyer, Aldinger; McCarl Spreen). When linear supply demand functions are assumed, spatial problem can be formulated as a quadratic programming problem. However, application, relatively small (QP) problems generally have been solved. Sometimes approximations (Duloy Norton) or alternative solution procedures (Tramel Seale, King Ho) used for larger because suitable large-scale algorithms not available.' Reactive Seale). there is controversy about whether this procedure achieves finite termination (see Takayama 1963, Ho). The purpose of paper to discuss procedure, similar reactive programming, which possesses analytically established convergence properties. This based on Benders' decomposition (Benders, Geoffrion, McCarl). presented here, originally developed by Polito, was discussed mathematically McCarl, Morin Litzenberg.