Generalized Lagrange Multipliers in Integer Programming

Jeremy F. Shapiro
Additional contact information
Jeremy F. Shapiro: Massachusetts Institute of Technology, Cambridge, Massachusetts

Operations Research, 1971, vol. 19, issue 1, 68-76

Abstract: This paper combines the theory of generalized Lagrange multipliers with a reformulation of the integer-programming problem due to group theory. The use of multipliers enhances the algorithmic efficiency of group theory in a variety of ways. One particular application is the approximation of generalized Lagrange multipliers by generalized linear programming as suggested by Brooks and Geoffrion. This procedure is shown to be closely related to the cutting-plane method of Gomory.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.1.68 (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:19:y:1971:i:1:p:68-76

Access Statistics for this article

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