Technical Note—Solving Integer Programming Problems by Aggregating Constraints

Kenneth E. Kendall and Stanley Zionts
Additional contact information
Kenneth E. Kendall: University of Wisconsin, Milwaukee, Wisconsin
Stanley Zionts: State University of New York, Buffalo, New York

Operations Research, 1977, vol. 25, issue 2, 346-351

Abstract: Integer programming problems with bounded variables can be solved by combining the constraints into an equivalent single constraint. This note presents a refinement to earlier work that reduces the size of the coefficients in the equivalent constraint and points out advantages as well as computational considerations for solving problems by this method.

Date: 1977
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.25.2.346 (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:25:y:1977:i:2:p:346-351

Access Statistics for this article

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