Improved convexity cuts for lattice point problems |
| |
Authors: | F. Glover D. Klingman |
| |
Affiliation: | (1) University of Colorado, Boulder, Colorado;(2) University of Texas, Austin, Texas |
| |
Abstract: | The generalized lattice point (GLP) problem provides a formulation that accommodates a variety of discrete alternative problems. In this paper, we show how to substantially strengthen the convexity cuts for the GLP problem. The new cuts are based on the identification ofsynthesized lattice point conditions to replace those that ordinarily define the cut. The synthesized conditions give an alternative set of hyperplanes that enlarge the convex set, thus allowing the cut to be shifted deeper into the solution space. A convenient feature of the strengthened cuts is the evidence of linking relationships by which they may be constructively generated from the original cuts. Geometric examples are given in the last section to show how the new cuts improve upon those previously proposed for the GLP problem. |
| |
Keywords: | Linear programming integer programming mathematical programming discrete systems lattice point problems |
本文献已被 SpringerLink 等数据库收录! |
|