Bounds for aggregating nodes in network problems
Publication
, Journal Article
Zipkin, PH
Published in: Mathematical Programming
December 1, 1980
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. © 1980 The Mathematical Programming Society.
Duke Scholars
Published In
Mathematical Programming
DOI
EISSN
1436-4646
ISSN
0025-5610
Publication Date
December 1, 1980
Volume
19
Issue
1
Start / End Page
155 / 177
Related Subject Headings
- Operations Research
- 4903 Numerical and computational mathematics
- 4901 Applied mathematics
- 4613 Theory of computation
- 0802 Computation Theory and Mathematics
- 0103 Numerical and Computational Mathematics
- 0102 Applied Mathematics
Citation
APA
Chicago
ICMJE
MLA
NLM
Zipkin, P. H. (1980). Bounds for aggregating nodes in network problems. Mathematical Programming, 19(1), 155–177. https://doi.org/10.1007/BF01581638
Zipkin, P. H. “Bounds for aggregating nodes in network problems.” Mathematical Programming 19, no. 1 (December 1, 1980): 155–77. https://doi.org/10.1007/BF01581638.
Zipkin PH. Bounds for aggregating nodes in network problems. Mathematical Programming. 1980 Dec 1;19(1):155–77.
Zipkin, P. H. “Bounds for aggregating nodes in network problems.” Mathematical Programming, vol. 19, no. 1, Dec. 1980, pp. 155–77. Scopus, doi:10.1007/BF01581638.
Zipkin PH. Bounds for aggregating nodes in network problems. Mathematical Programming. 1980 Dec 1;19(1):155–177.
Published In
Mathematical Programming
DOI
EISSN
1436-4646
ISSN
0025-5610
Publication Date
December 1, 1980
Volume
19
Issue
1
Start / End Page
155 / 177
Related Subject Headings
- Operations Research
- 4903 Numerical and computational mathematics
- 4901 Applied mathematics
- 4613 Theory of computation
- 0802 Computation Theory and Mathematics
- 0103 Numerical and Computational Mathematics
- 0102 Applied Mathematics