Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/101775
Authors: 
Chipman, John Somerset
Winker, Peter
Year of Publication: 
1994
Series/Report no.: 
Diskussionsbeiträge: Serie II, Sonderforschungsbereich 178 "Internationalisierung der Wirtschaft", Universität Konstanz 236
Abstract: 
A widely used method in the analysis of complex econometric models is to replace the "true model" by an aggregative one in which the variables are grouped and replaced by sums or weighted averages of the variables in each group. The analysis of the problem of choosing an aggregative model optimally for modes of aggregation specified in advance leads to a formula for the aggregation bias based on the mean-square forecast error. Taking this formula as objective function one would wish to choose a grouping that minimizes aggregation bias. Unfortunately this results in an optimization problem of a high degree of complexity, which means that there is probably no exact optimization algorithm that works in economic Computing time. In the last few years however, many efficient multiple-purpose optimization heuristics have been developed for complex problems such as the traveling salesman problem, optimal chip layout or optimal portfolio composition. One example of such an algorithm is the Threshold Accepting Algorithm (TA). We implement TA for the optimal aggregation of price indices. The algorithm and the resulting groupings are presented. The results show that the use of Standard or "official" modes of aggregation will in general be far from being optimal.
Subjects: 
Aggregation
integer programming
optimization heuristics
industrial Classification
Document Type: 
Working Paper

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.