IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v261y2017i3p1141-1157.html
   My bibliography  Save this article

Automatic synthesis of constraints from examples using mixed integer linear programming

Author

Listed:
  • Pawlak, Tomasz P.
  • Krawiec, Krzysztof

Abstract

Constraints form an essential part of most practical search and optimization problems, and are usually assumed to be given. However, there are plausible real-world scenarios in which constraints are not known or can be only approximated, for instance when the process in question is complex and/or noisy. To address such problems, we propose a method that synthesizes constrains from examples of feasible and infeasible solutions. The method can produce linear, quadratic and trigonometric constraints that are guaranteed to separate the feasible and infeasible regions and minimize the number of terms involved. The synthesized constraints are represented symbolically and can be used to simulate, predict or optimize the original process. We assess empirically several characteristics of the method on three benchmarks, in particular the fidelity and the complexity of the synthesized constraints with respect to the actual constraints. We also demonstrate its application to a real-world process of concrete manufacturing. Experiments demonstrate that the method is capable of producing human-readable constraints that reflect well the underlying process and can be used to simulate it.

Suggested Citation

  • Pawlak, Tomasz P. & Krawiec, Krzysztof, 2017. "Automatic synthesis of constraints from examples using mixed integer linear programming," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1141-1157.
  • Handle: RePEc:eee:ejores:v:261:y:2017:i:3:p:1141-1157
    DOI: 10.1016/j.ejor.2017.02.034
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722171730156X
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2017.02.034?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Pawlak, Tomasz P. & Litwiniuk, Bartosz, 2021. "Ellipsoidal one-class constraint acquisition for quadratically constrained programming," European Journal of Operational Research, Elsevier, vol. 293(1), pages 36-49.
    2. Potoniec, Jedrzej & Sroka, Daniel & Pawlak, Tomasz P., 2022. "Continuous discovery of Causal nets for non-stationary business processes using the Online Miner," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1304-1320.
    3. Hewitt, Mike & Frejinger, Emma, 2020. "Data-driven optimization model customization," European Journal of Operational Research, Elsevier, vol. 287(2), pages 438-451.
    4. Fajemisin, Adejuyigbe O. & Maragno, Donato & den Hertog, Dick, 2024. "Optimization with constraint learning: A framework and survey," European Journal of Operational Research, Elsevier, vol. 314(1), pages 1-14.

    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:eee:ejores:v:261:y:2017:i:3:p:1141-1157. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.