Bounds for Row-Aggregation in Linear Programming

Paul H. Zipkin
Additional contact information
Paul H. Zipkin: Columbia University, New York, New York

Operations Research, 1980, vol. 28, issue 4, 903-916

Abstract: Most applied linear programs reflect a certain degree of aggregation—either explicit or implicit—of some larger, more detailed problem. This paper develops methods for assessing the loss in accuracy resulting from aggregation. We showed previously that, when columns only are aggregated, a feasible solution to the larger problem can be recovered. This may not be the case under row-aggregation. Several reasonable measures of “accuracy loss” for this case are defined, and the bounds on these quantities derived. These results enable the modeler to compare and evaluate alternative approximate models of the same problem.

Date: 1980
References: Add references at CitEc
Citations: View citations in EconPapers (22)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.28.4.903 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:28:y:1980:i:4:p:903-916

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().