Computing optimality certificates for convex mixed-integer nonlinear problems

  • Every optimization problem has a corresponding verification problem which verifies 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, e.g., the branch-and-bound tree. To simplify this task, Baes et al. introduced optimality certificates for convex mixed-integer nonlinear programs and proved that these are bounded in 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.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Author:Katrin Halbig, Lukas Hümbs, Florian Rösel, Lars Schewe, Dieter Weninger
Document Type:Preprint
Date of Publication (online):2021/11/12
Release Date:2021/11/12
Institutes:Friedrich-Alexander-Universität Erlangen-Nürnberg
Licence (German):License LogoCreative Commons - CC BY - Namensnennung 4.0 International