TY - INPR A1 - Halbig, Katrin A1 - Hümbs, Lukas A1 - Rösel, Florian A1 - Schewe, Lars A1 - Weninger, Dieter T1 - Computing optimality certificates for convex mixed-integer nonlinear problems N2 - 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. Y1 - 2021 UR - https://opus4.kobv.de/opus4-trr154/frontdoor/index/index/docId/476 ER -