Technical Note—On the Generalized Lattice Point Problem and Nonlinear Programming

A. Victor Cabot
Additional contact information
A. Victor Cabot: Indiana University, Bloomington, Indiana

Operations Research, 1975, vol. 23, issue 3, 565-571

Abstract: In this paper we consider a problem that is equivalent to the generalized lattice point problem of nonconvex programming. This problem can be expressed as the maximization of a certain convex function over a convex polyhedral set. This formulation can be used with the cutting plane algorithm of Glover and Klingman sometimes to strengthen the cuts their method generates for the generalized lattice point problem. A cut for zero-one integer programming can also be derived.

Date: 1975
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.3.565 (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:23:y:1975:i:3:p:565-571

Access Statistics for this article

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