Back to Search
Start Over
GENERALIZED CUTS IN DIOPHANTINE PROGRAMMING.
- Source :
- Management Science; Nov66, Vol. 13 Issue 3, p254-268, 15p
- Publication Year :
- 1966
-
Abstract
- In the generation of an additional constraint or cut for integer programming introduced by Ralph Gomory, there is a certain parameter whose value is customarily chosen so that one of the original variables has a zero coefficient in the cut-equation. In this paper we consider alternative values of the parameter and refer to any linear combination of the original source equation and this cut as a "generalised cut." Attention is then focused, as customary, on those cuts of this type for which the original variable has a zero coefficient. In particular, we show how to determine values for Gomory's parameter so that only a subset of the feasible solutions to the cuts used by Gomory's method of integer forms are feasible for the generalized cuts. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00251909
- Volume :
- 13
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- Management Science
- Publication Type :
- Academic Journal
- Accession number :
- 7355699
- Full Text :
- https://doi.org/10.1287/mnsc.13.3.254