A Generated Cut for Primal Integer Programming

Larry R. Arnold and Mandell Bellmore
Additional contact information
Larry R. Arnold: Tulane University, New Orleans, Louisiana
Mandell Bellmore: Block, McGibony and Associates, Silver Spring, Maryland

Operations Research, 1974, vol. 22, issue 1, 137-143

Abstract: This paper develops a new cutting plane for primal integer programming. This cut, when it exists and is vised as pivot row, has the property that the minimum of the simplex evaluators of the next tableau is strictly larger (by an integer) than the minimum for the current tableau. The paper gives a sufficient condition in the form of a linear program for the existence of such a cut, and proposes an algorithm for generating such cuts. It also presents two additional sufficient conditions. The process of cut generation is then imbedded into a convergent primal algorithm to be used in an attempt to overcome the proof-of-optimality problem experienced with the primal algorithm.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.22.1.137 (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:22:y:1974:i:1:p:137-143

Access Statistics for this article

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