Hypercylindrically Deduced Cuts in Zero-One Integer Programs

R. D. Young
Additional contact information
R. D. Young: Rice University, Houston, Texas

Operations Research, 1971, vol. 19, issue 6, 1393-1405

Abstract: A zero-one mixed integer program in which the integer variables always sum to a constant k in any feasible solution has its solution set contained in the hypercylinder ∑ x i 2 ≦ k . Moreover, integer solutions always satisfy ∑ x i 2 = k , while ∑ x i 2 k for fractional solutions. This situation permits the construction of valid cuts by extending the edges incident at a non-integer extreme point until they intersect the boundary of the hypercylinder; the cut hyperplane is determined by the points where the edge extensions intersect the boundary of the hypercylinder. Generalizations of this special model, due to Glover and Balas, are discussed, as is the use of these cuts in finite algorithms.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.6.1393 (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:6:p:1393-1405

Access Statistics for this article

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