Aggregating assignment constraints

Peter C. Fishburn and Gary A. Kochenberger

Naval Research Logistics Quarterly, 1985, vol. 32, issue 4, 653-663

Abstract: This article shows how simple systems of linear equations with {0,1} variables can be aggregated into a single linear equation whose {0,1} solutions are identical to the solutions of the original system. Structures of the original systems are exploited to keep the aggregator's integer coefficients from becoming unnecessarily large. The results have potential application in integer programming and information theory, especially for problems that contain assignment‐type constraints along with other constraints. Several unresolved questions of a number‐theoretic nature are mentioned at the conclusion of the article.

Date: 1985
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800320412

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:wly:navlog:v:32:y:1985:i:4:p:653-663

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().