Abstract
This paper describes our experience in implementing an industrial application using thefinite domain solver of the ECLi PSe constraint logic programming (CLP) system, inconjunction with the mathematical programming (MP) system, FortMP. In this technique,the ECLi PSe system generates a feasible solution that is adapted to construct a starting point(basic solution) for the MP solver. The basic solution is then used as an input to the FortMPsystem to warm-start the simplex (SX) algorithm, hastening the solution of the linearprogramming relaxation, (LPR). SX proceeds as normal to find the optimal integer solution.Preliminary results indicate that the integration of the two environments is suitable for thisapplication in particular, and may generally yield significant benefits. We describe adaptationsrequired in the hybrid method, and report encouraging experimental results for thisproblem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.J. Dakin, A tree search algorithm for mixed integer programming problems, The Computer Journal 8((1965)250–255
E. Davis, Constraint propagation with interval labels, Artificial Intelligence 32(1987) 281–331
H. El-Sakkout, Modelling fleet assignment in a flexible environment, Proceedings of the 2nd International Conference on the Practical Application of Constraint Technology, The Practical Application Company Ltd, 1996, pp. 27–39.
E.F.D. Ellison et al., FortMP, User Guide and Reference Manual, Nag Ltd, Oxford, UK, 1995.
H. Gallaire, Logic programming: Further developments, in: IEEE Symposium on Logic Programming, Boston, MA, July 1985.
M.T. Hajian, Computational methods for discrete programming problems, Ph.D. Thesis, Mathematics and Statistics Department, Brunel, University of West London, 1992.
R.M. Haralick and G.L. Elliot, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence 14(1980)263–314.
J. Jaffar and J.-L. Lassez, Constraint Logic Programming, in: POPL-87, Munich, Germany, January 1987.
H.W. Kuhn and A.W. Tucker, Linear Inequalities and Related Systems, Princeton University Press, Princeton, NJ, 1956.
A. Land and A.W. Tucker, An automatic method for solving discrete programming problems, Econometrica 28(1960)497–520.
A.K. Mackworth, Consistency in networks of relations, Artificial Intelligence 8(1977) 99–118.
G. Mitra, Theory and Application of Mathematical Programming, Academic Press, London, 1976.
U. U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Science 7(1974)95–132.
G.L. Nemhauser and E.R. Wolsey, Integer and Combinatorial Optimisation, Wiley, New York, 1988.
G.J. Sussman and G.L. Steele, CONSTRAINTS: A language for expressing almost-hierarchical descriptions, Artificial Intelligence 14(1980)1–39.
M. Tamiz, Design implementation and testing of a general linear programming system exploiting sparsity, Ph.D. Thesis, Mathematics and Statistics Department, Brunel, University of West London, 1986.
P. Van Hentenryck, Constraint Satisfaction in Logic Programming, Logic Programming Series, The MIT Press, 1989.
Rights and permissions
About this article
Cite this article
Hajian, M.T., El-Sakkout, H., Wallace, M. et al. Towards a closer integration of finite domainpropagation and simplex-based algorithms. Annals of Operations Research 81, 421–433 (1998). https://doi.org/10.1023/A:1018977712248
Issue Date:
DOI: https://doi.org/10.1023/A:1018977712248