A Method of Decomposition for Integer Programs

Dennis J. Sweeney and Richard A. Murphy
Additional contact information
Dennis J. Sweeney: University of Cincinnati, Cincinnati, Ohio
Richard A. Murphy: University of Cincinnati, Cincinnati, Ohio

Operations Research, 1979, vol. 27, issue 6, 1128-1141

Abstract: A method of decomposing integer programs with block angular structure is presented. It is based on the notion of searching for the optimal solution to an integer program among the near-optimal solutions to its Lagrangian relaxation. An optimality theorem is obtained and a generic decomposition algorithm is presented. An application of this approach is discussed and some computational results are reported.

Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.27.6.1128 (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:27:y:1979:i:6:p:1128-1141

Access Statistics for this article

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