Towards a closer integration of finite domainpropagation and simplex-based algorithms
Mozafar Hajian,
Hani El-Sakkout,
Mark Wallace,
Jonathan Lever and
Barry Richards
Annals of Operations Research, 1998, vol. 81, issue 0, 433 pages
Abstract:
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. Copyright Kluwer Academic Publishers 1998
Date: 1998
References: Add references at CitEc
Citations:
Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018977712248 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:81:y:1998:i:0:p:421-433:10.1023/a:1018977712248
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479
DOI: 10.1023/A:1018977712248
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().