In this paper an entropy model with variable target is presented, in which target values are assumed to belong to a specified convex set, so that multiple base-year information and forecasts of future trends can be handled without prior aggregation of such information into one fixed target.
Three solution methods for such a model are presented—one cutting-plane and two search methods—all of which utilize the fact that entropy models with fixed targets can be solved efficiently. Some comments on potential applications and reasonable target-set specifications are made and numerical examples are presented.
Get full access to this article
View all access options for this article.
References
1.
BattyMMarchL, 1976, “The method of residues in urban modelling”Environment and Planning A8189–215
2.
BertsekasD P, 1976, “On the Goldstein — Levitin — Polyak gradient projection method”IEEE Transactions on Automatic Control21174–184
3.
BregmanL, 1967, “The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming”USSR Computational Mathematics and Mathematical Physics7200–217
4.
ErikssonJ, 1980, “A note on solution of large sparse entropy problems with linear equality constraints”Mathematical Programming18146–154
5.
ErikssonJ, 1988, “The simultaneous two-step entropy model”Journal of Computational and Applied Mathematics22271–283
6.
ErlanderS, 1981, “Entropy in linear programming”Mathematical Programming21137–151
7.
GeoffrionA M, 1972, “Generalized Benders decomposition”Journal of Optimization Theory and Applications10237–260
