IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v81y1998i0p421-43310.1023-a1018977712248.html
   My bibliography  Save this article

Towards a closer integration of finite domainpropagation and simplex-based algorithms

Author

Listed:
  • Mozafar Hajian
  • Hani El-Sakkout
  • Mark Wallace
  • Jonathan Lever
  • Barry Richards

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

Suggested Citation

  • Mozafar Hajian & Hani El-Sakkout & Mark Wallace & Jonathan Lever & Barry Richards, 1998. "Towards a closer integration of finite domainpropagation and simplex-based algorithms," Annals of Operations Research, Springer, vol. 81(0), pages 421-433, June.
    • Handle: RePEc:spr:annopr:v:81:y:1998:i:0:p:421-433:10.1023/a:1018977712248
    DOI: 10.1023/A:1018977712248
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018977712248
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018977712248?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:81:y:1998:i:0:p:421-433:10.1023/a:1018977712248. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.