IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v36y2024i6p1579-1610.html
   My bibliography  Save this article

Computing Optimality Certificates for Convex Mixed-Integer Nonlinear Problems

Author

Listed:
  • Katrin Halbig

    (Department of Data Science, Friedrich-Alexander-Universität Erlangen-Nürnberg, 91058 Erlangen, Germany)

  • Lukas Hümbs

    (Department of Data Science, Friedrich-Alexander-Universität Erlangen-Nürnberg, 91058 Erlangen, Germany)

  • Florian Rösel

    (Department of Data Science, Friedrich-Alexander-Universität Erlangen-Nürnberg, 91058 Erlangen, Germany)

  • Lars Schewe

    (School of Mathematics and Maxwell Institute for Mathematical Sciences, University of Edinburgh, Edinburgh EH9 3FD, United Kingdom)

  • Dieter Weninger

    (Department of Data Science, Friedrich-Alexander-Universität Erlangen-Nürnberg, 91058 Erlangen, Germany)

Abstract

Every optimization problem has a corresponding verification problem that checks whether a given optimal solution is in fact optimal. In the literature, there are a lot of such ways to verify optimality for a given solution, for example, the branch-and-bound tree. To simplify this task, optimality certificates were introduced for convex mixed-integer nonlinear programs, and it was shown that the sizes of the certificates are bounded in terms of the number of integer variables. We introduce an algorithm to compute the certificates and conduct computational experiments. Through the experiments, we show that the optimality certificates can be surprisingly small.

Suggested Citation

  • Katrin Halbig & Lukas Hümbs & Florian Rösel & Lars Schewe & Dieter Weninger, 2024. "Computing Optimality Certificates for Convex Mixed-Integer Nonlinear Problems," INFORMS Journal on Computing, INFORMS, vol. 36(6), pages 1579-1610, December.
    • Handle: RePEc:inm:orijoc:v:36:y:2024:i:6:p:1579-1610
    DOI: 10.1287/ijoc.2022.0099
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2022.0099
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ijoc.2022.0099?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
    ---><---

    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:inm:orijoc:v:36:y:2024:i:6:p:1579-1610. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.