Surrogate Dual Multiplier Search Procedures in Integer Programming

Mark H. Karwan and Ronald L. Rardin
Additional contact information
Mark H. Karwan: State University of New York, Buffalo, New York
Ronald L. Rardin: Purdue University, West Lafayette, Indiana

Operations Research, 1984, vol. 32, issue 1, 52-69

Abstract: Search procedures for optimal Lagrange multipliers are highly developed and provide good bounds in branch and bound procedures that have led to the successful application of Lagrangean duality in integer programming. Although the surrogate dual generally provides a better objective bound, there has been little development of surrogate multiplier search procedures. This paper develops and empirically analyzes several surrogate multiplier search procedures. Results indicate that the procedures can produce possibly superior bounds in an amount of time comparable to other techniques. Our discussion also highlights the similarity of the procedures to some well known Lagrangean search techniques.

Keywords: 625 surrogate dual multipliers search; 626 surrogate duals and relaxation (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.32.1.52 (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:32:y:1984:i:1:p:52-69

Access Statistics for this article

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