Aggregation and disaggregation in convex network problems

Published

Journal Article

This article considers the error induced when the nodes of a large convex‚Äźcost network problem are aggregated to form a smaller problem. First, I formalize the notion of aggregation, focusing on disaggregation of the solution and construction of the cost functions of the aggregate problem. I then explore qualitatively the conditions under which the error is likely to be small, and show how to compute bounds on the error. Copyright © 1982 Wiley Periodicals, Inc., A Wiley Company

Full Text

Duke Authors

Cited Authors

  • Zipkin, PH

Published Date

  • January 1, 1982

Published In

Volume / Issue

  • 12 / 2

Start / End Page

  • 101 - 117

Electronic International Standard Serial Number (EISSN)

  • 1097-0037

International Standard Serial Number (ISSN)

  • 0028-3045

Digital Object Identifier (DOI)

  • 10.1002/net.3230120203

Citation Source

  • Scopus