Abstract
The global constraint sum can be used as a tool to implement summations over sets of variables whose indices are not known in advance. This paper has two major contributions. On the theoretical side, we present the convex hull relaxation for the sum constraint in terms of linear inequalities, whose importance in the context of hybrid models is then justified. On the practical side, we demonstrate the applicability of the sum constraint in a scheduling problem that arises as part of the development of new products in the pharmaceutical and agrochemical industries. This problem can be modeled in two alternative ways: by using the sum constraint in a natural and straightforward manner, or by using the element constraint in a trickier fashion. With the convex hull relaxation developed earlier, we prove that the linear relaxation obtained from the former model is tighter than the one obtained from the latter. Moreover, our computational experiments indicate that the CP model based on the sum constraint is significantly more efficient as well.
Supported by the William Larimer Mellon Fellowship.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Balas. Disjunctive programming: Properties of the convex hull of feasible points. Discrete Applied Mathematics, 89:3–44, 1998.
J. F. Benders. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4:238–252, 1962.
G. Blau, B. Mehta, S. Bose, J. Pekny, G. Sinclair, K. Keunker, and P. Bunch. Risk management in the development of new products in highly regulated industries. Computers and Chemical Engineering, 24:659–664, 2000.
A. Bockmayr and T. Kasper. Branch and infer: A unifying framework for integer and finite domain constraint programming. INFORMS Journal on Computing, 10(3):287–300, 1998.
S. Honkomp, G. Reklaitis, and J. Pekny. Robust planning and scheduling of process development projects under stochastic conditions. Presented at the AICHE annual meeting, Los Angeles, CA, 1997.
J. N. Hooker. Logic-Based Methods for Optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization, 2000.
J. N. Hooker and M. A. Osorio. Mixed logical/linear programming. Discrete Applied Mathematics, 96–97(1–3):395–442, 1999.
IC-Parc, Imperial College, London. The ECLiPSe Constraint Logic Programming System. http://www.icparc.ic.ac.uk/eclipse.
V. Jain and I. Grossmann. Resource-constrained scheduling of tests in new product development. Industrial and Engineering Chemistry Research, 38(8):3013–3026, 1999.
C. Schmidt and I. Grossmann. Optimization models for the scheduling of testing tasks in new product development. Industrial and Engineering Chemistry Research, 35(10):3498–3510, 1996.
E. S. Thorsteinsson. Branch-and-Check: A hybrid framework integrating mixed integer programming and constraint logic programming. In Toby Walsh, editor, Proceedings of the Seventh International Conference on Principles and Practice of Constraint Programming, volume 2239 of Lecture Notes in Computer Science, pages 16–30. Springer-Verlag, November 2001.
E. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yunes, T.H. (2002). On the Sum Constraint: Relaxation and Applications. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_6
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive