| Abstract: | This paper presents a lemma and a theorem which demonstrate equivalent ways of formulating certain mathematical-programming problems. The first shows, in general terms, how constraints can be “absorbed” into the objective function and vice versa. The second shows how such ideas can be applied to spatial analysis problems involving the minimization of development costs subject to interactions being determined by (suboptimal) entropy-maximizing models. This provides both a new perspective on the relationship between programming and entropy models, and formulations that are computationally convenient. |
