Aggregation and Disaggregation in Integer Programming Problems

Åsa Hallefjord and Sverre Storøy
Additional contact information
Åsa Hallefjord: Chr. Michelsen Institute, Bergen, Norway
Sverre Storøy: University of Bergen, Bergen, Norway

Operations Research, 1990, vol. 38, issue 4, 619-623

Abstract: Column aggregation of 0/1 programming problems is considered. By relaxing the integer requirements in the aggregated problem, an easy problem results, the solution of which can be used to compute bounds on the loss of accuracy in the objective function value. It is shown how these bounds can be improved by identification of valid inequalities and by exploiting primal degeneracy. A small example is given to illustrate the procedure.

Keywords: programming; integer: integer algorithms (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.4.619 (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:38:y:1990:i:4:p:619-623

Access Statistics for this article

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