The Generalized Lattice-Point Problem

Fred Glover and D. Klingman
Additional contact information
Fred Glover: University of Colorado, Boulder, Colorado
D. Klingman: The University of Texas, Austin, Texas

Operations Research, 1973, vol. 21, issue 1, 141-155

Abstract: The generalized lattice-point problem, posed by Charnes and studied by M. J. L. Kirby, H. Love, and others, is a linear program whose solutions are constrained to be extreme points of a specified polytope. We show how to exploit this and more general problems by convexity (or intersection) cut strategies without resorting to standard problem-augmenting techniques such as introducing 0-1 variables. In addition, we show how to circumvent “degeneracy” difficulties inherent in this problem without relying on perturbation (which provides uselessly shallow cuts) by identifying nondegenerate subregions relative to which cuts may be defined effectively. Finally, we give results that make it possible to obtain strengthening cuts for problems with special structures.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.1.141 (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:21:y:1973:i:1:p:141-155

Access Statistics for this article

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