Abstract
It is often necessary or desirable in practice to replace a large, detailed optimization model with a smaller, approximate model. It would be useful to have bounds on the error resulting from this process of aggregation. This paper develops such bounds for a class of linear minimum-cost network-flow problems, where groups of nodes in a large problem are replaced by aggregate nodes. Two types of bounds are derived: A priori bounds are available before solving the aggregated problem; a posteriori bounds, which are generally tighter, may be computed afterwards.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Anderberg,Cluster analysis for applications (Academic Press, New York, 1973).
E. Balas, “Solution of large scale transportation problems through aggregation”,Operations Research 13 (1965) 82–93.
A. Geoffrion, “Customer aggregation in distribution modeling”, Working paper No. 259, Management Science Study Center, University of California (Los Angeles, CA, October 1976).
D. Hearn and H. Kuhn, Network aggregation in transportation planning—final report (draft), Mathtech, Inc. (Princeton, NJ, November 1977).
Y. Ijiri, “Fundamental queries in aggregation theory”,Journal of the American Statistical Association 66 (1971) 766–782.
H. Kuhn and D. Cullen, Aggregation in network models for transportation planning—final report, Mathtech, Inc. (Princeton, NJ. October 1975).
S. Lee, Surrogate programming through aggregation, Dissertation, University of California (Los Angeles, CA, 1975).
A. Thomas, Models for optimal capacity expansion, Dissertation, Yale University (New Haven, CT, 1977).
H. Wagner,Principles of operations research (2nd ed.) (Prentice-Hall, Englewood Cliffs, NJ, 1975).
W. Whitt, “Approximations of dynamic programs, I”,Mathematics of Operations Research 3 (1978) 231–243.
P. Zipkin, “A priori bounds for aggregated linear programs with fixed-weight disaggregation”, presented at TIMS/ORSA joint meeting (San Francisco, CA, May 1977).
P. Zipkin, Aggregation in linear programming, Dissertation, Yale University (New Haven, CT, 1977).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zipkin, P.H. Bounds for aggregating nodes in network problems. Mathematical Programming 19, 155–177 (1980). https://doi.org/10.1007/BF01581638
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01581638