Abstract
This paper presents a new surrogate constraint analysis that givesrise to a family of strong valid inequalities calledsurrogate-knapsack (S-K) cuts. The analytical procedure presentedprovides a strong S-K cut subject to constraining the values ofselected cut coefficients, including the right-hand side. Ourapproach is applicable to both zero-one integer problems and problemshaving multiple choice (generalized upper bound) constraints. We alsodevelop a strengthening process that further tightens the S-K cutobtained via the surrogate analysis. Building on this, we develop apolynomial-time separation procedure that successfully generates anS-K cut that renders a given non-integer extreme point infeasible. Weshow how sequential lifting processes can be viewed in our framework,and demonstrate that our approach can obtain facets that are notavailable to standard lifting methods. We also provide a relatedanalysis for generating “fast cuts”. Finally, we presentcomputational results of the new S-K cuts for solving 0-1 integerprogramming problems. Our outcomes disclose that the new cuts arecapable of reducing the duality gap between optimal continuous andinteger feasible solutions more effectively than standard liftedcover inequalities, as used in modern codes such as the CPLEX mixed0-1 integer programming solver.
Similar content being viewed by others
References
E. Balas, "Facets of the knapsack polytope," Mathematical Programming, vol. 8, pp. 146–164, 1975.
E. Balas and E. Zemel, "Facets of the knapsack polytope from minimal covers," SIAM Journal on Applied Mathematics, vol. 34, pp. 119–148, 1978.
R.E. Bixby, E.A. Boyd, S.S. Dadmehr, and R.R. Indovina, "The MIPLIB mixed integer library," Technical Report R92-36, Rice University, 1992.
V. Chvátal, "Edmonds polytopes and a hierarchy of combinatorial problems," Discrete Mathematics, vol. 4, pp. 305–357, 1973.
CPLEX Version 3.0, Using the CPLEX Callable Library, CPLEX Optimization, Inc., 1995.
H. Crowder, E.L. Johnson, and M. Padberg, "Solving large-scale zero-one linear programming problems," Operations Research, vol. 31, pp. 803–834, 1983.
B.L. Dietrich, L.F. Escudero, and F. Chance, "Efficient reformulation for 0-1 programs, methods and computational results," Discrete Applied Mathematics, vol. 42, pp. 147–175, 1993.
B.L. Dietrich and L.F. Escudero, "Obtauning clique, cover and coefficient reduction inequalities as Chvátal-Gomory inequalities and Gomory fractional cuts," European Journal of Operational Research, vol. 73, pp. 539–546, 1994.
F. Glover, "A multi-phase-dual algorithm for the zero-one integer programming problem," Operations Research, vol. 13, pp. 879–919, 1965.
F. Glover, "Generalized cuts in diophantine programming," Management Science, vol. 13, pp. 254–268, 1966.
F. Glover, "Surrogate constraunts," Operations Research, vol. 16, pp. 741–749, 1968.
F. Glover, "Surrogate constraunt duality in mathematical programming," Operations Research, vol. 23, pp. 434–451, 1975.
R.E. Gomory, "Outline of an algorithm for integer solutions to linear programs," Bulletin of the American Mathematical Society, vol. 64, pp. 275–278, 1958.
R.E. Gomory, "Solving linear programming problems in integers," in Combinatorial Analysis, R.E. Bellman and M. Hall, Jr. (Eds.), American Mathematical Society, pp. 211–216, 1960.
R.E. Gomory, "An algorithm for integer solutions to linear programs," in Recent Advances in Mathematical Programming, R. Graves and P. Wolfe (Eds.), McGraw-Hill, pp. 269–362.
H.J. Greenberg and W.P. Pierskalla, "Surrogate mathematical programs," Operations Research, vol. 18, pp. 924–939, 1970.
H.J. Greenberg and W.P. Pierskalla, "Quasi conjugate functions and surrogate duality," Cahiers du Centre dÉtudes de Recherche Operationell, vol. 15, pp. 230–334, 1973.
P.L. Hammer, E.L Johnson, and U.N. Peled, "Facets of regular 0-1 polytopes," Mathematical Programming, vol. 8, pp. 179–206, 1975.
K. Hoffman, Informal Communication, May 1996.
K. Hoffman and M. Padberg, "Improving LP-representations of zero-one linear programs for branch-and-cut," ORSA Journal on Computing, vol. 3, pp. 121–134, 1991.
M.H. Karwan and R.L. Rardin, "Some relationships between Lagrangian and surrogate duality in integer programming," Mathematical Programming, vol. 17, pp. 320–324, 1979.
R.K. Martin and L. Schrage, "Subset coefficient reduction cuts for 0-1 mixed integer programming," Operations Research, vol. 33, pp. 505–526, 1985.
G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons: New York, 1988.
M. Padberg, "(1; k) configuration and facets for packing problem," Mathematical Programming, vol. 18, pp. 94–99, 1980.
M.W.P. Savelsbergh and G.L. Nemhauser, Mixed INTeger Optimizer (MINTO) Version 2.0, 1994.
L.A. Wolsey, "Faces for a linear inequality in 0-1 variables," Mathematical Programming, vol. 8, pp. 165–178, 1975.
E. Zemel, "Lifting the facets of zero-one polytopes," Mathematical Programming, vol. 15, pp. 268–277, 1978.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Glover, F., Sherali, H.D. & Lee, Y. Generating Cuts from Surrogate Constraint Analysis for Zero-One and Multiple Choice Programming. Computational Optimization and Applications 8, 151–172 (1997). https://doi.org/10.1023/A:1008621204567
Issue Date:
DOI: https://doi.org/10.1023/A:1008621204567