Bounds for aggregating nodes in network problems

Journal Article (Journal Article)

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.

Full Text

Duke Authors

Cited Authors

  • Zipkin, PH

Published Date

  • December 1, 1980

Published In

Volume / Issue

  • 19 / 1

Start / End Page

  • 155 - 177

Electronic International Standard Serial Number (EISSN)

  • 1436-4646

International Standard Serial Number (ISSN)

  • 0025-5610

Digital Object Identifier (DOI)

  • 10.1007/BF01581638

Citation Source

  • Scopus