IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v91y2025i2d10.1007_s10898-024-01376-2.html
   My bibliography  Save this article

On the use of overlapping convex hull relaxations to solve nonconvex MINLPs

Author

Listed:
  • Ouyang Wu

    (HAW Hamburg)

  • Pavlo Muts

    (HAW Hamburg)

  • Ivo Nowak

    (HAW Hamburg)

  • Eligius M. T. Hendrix

    (Universidad de Málaga)

Abstract

We present a novel relaxation for general nonconvex sparse MINLP problems, called overlapping convex hull relaxation (CHR). It is defined by replacing all nonlinear constraint sets by their convex hulls. If the convex hulls are disjunctive, e.g. if the MINLP is block-separable, the CHR is equivalent to the convex hull relaxation obtained by (standard) column generation (CG). The CHR can be used for computing an initial lower bound in the root node of a branch-and-bound algorithm, or for computing a start vector for a local-search-based MINLP heuristic. We describe a dynamic block and column generation (DBCG) MINLP algorithm to generate the CHR by dynamically adding aggregated blocks. The idea of adding aggregated blocks in the CHR is similar to the well-known cutting plane approach. Numerical experiments on nonconvex MINLP instances show that the duality gap can be significantly reduced with the results of CHRs. DBCG is implemented as part of the CG-MINLP framework Decogo, see https://decogo.readthedocs.io/en/latest/index.html .

Suggested Citation

  • Ouyang Wu & Pavlo Muts & Ivo Nowak & Eligius M. T. Hendrix, 2025. "On the use of overlapping convex hull relaxations to solve nonconvex MINLPs," Journal of Global Optimization, Springer, vol. 91(2), pages 415-436, February.
    • Handle: RePEc:spr:jglopt:v:91:y:2025:i:2:d:10.1007_s10898-024-01376-2
    DOI: 10.1007/s10898-024-01376-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-024-01376-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-024-01376-2?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.

    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:jglopt:v:91:y:2025:i:2:d:10.1007_s10898-024-01376-2. 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.