Towards a closer integration of finite domainpropagation and simplex-based algorithms
- 40 Downloads
This paper describes our experience in implementing an industrial application using thefinite domain solver of the ECL i PS e constraint logic programming (CLP) system, inconjunction with the mathematical programming (MP) system, FortMP. In this technique,the ECL i PS e 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.
KeywordsFeasible Solution Linear Programming Relaxation Close Integration Finite Domain Plane Type
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- E.F.D. Ellison et al., FortMP, User Guide and Reference Manual, Nag Ltd, Oxford, UK, 1995.Google Scholar
- H. Gallaire, Logic programming: Further developments, in: IEEE Symposium on Logic Programming, Boston, MA, July 1985.Google Scholar
- M.T. Hajian, Computational methods for discrete programming problems, Ph.D. Thesis, Mathematics and Statistics Department, Brunel, University of West London, 1992.Google Scholar
- J. Jaffar and J.-L. Lassez, Constraint Logic Programming, in: POPL-87, Munich, Germany, January 1987.Google Scholar
- H.W. Kuhn and A.W. Tucker, Linear Inequalities and Related Systems, Princeton University Press, Princeton, NJ, 1956.Google Scholar
- G. Mitra, Theory and Application of Mathematical Programming, Academic Press, London, 1976.Google Scholar
- G.L. Nemhauser and E.R. Wolsey, Integer and Combinatorial Optimisation, Wiley, New York, 1988.Google Scholar
- 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.Google Scholar
- P. Van Hentenryck, Constraint Satisfaction in Logic Programming, Logic Programming Series, The MIT Press, 1989.Google Scholar