On solving nonconvex MINLP problems with SHOT

A4 Conference proceedings

Internal Authors/Editors

Publication Details

List of Authors: Andreas Lundell, Jan Kronqvist
Editors: Hoai An Le Thi, Hoai Minh Le, Tao Pham Dinh
Publication year: 2020
Publisher: Springer
Book title: Optimization of complex systems: Theory, models, algorithms and applications
Title of series: Advances in intelligent systems and computing
Volume number: 991
Start page: 448
End page: 457
ISBN: 978-3-030-21802-7
eISBN: 978-3-030-21803-4
ISSN: 2194-5357


The Supporting Hyperplane Optimization Toolkit (SHOT) solver was originally developed for solving convex MINLP problems, for which it has proven to be very efficient. In this paper, we describe some techniques and strategies implemented in SHOT for improving its performance on nonconvex problems. These include utilizing an objective cut to force an update of the best known solution and strategies for handling infeasibilities resulting from supporting hyperplanes and cutting planes generated from nonconvex constraint functions. For convex problems, SHOT gives a guarantee to find the global optimality, but for general nonconvex problems it will only be a heuristic. However, utilizing some automated transformations it is actually possible in some cases to reformulate all nonconvexities into linear form, ensuring that the obtained solution is globally optimal. Finally, SHOT is compared to other MINLP solvers on a few nontrivial test problems to illustrate its performance.


Feasibility relaxation, Nonconvex MINLP, Reformulation techniques, Supporting Hyperplane Optimization Toolkit (SHOT)

Last updated on 2020-04-04 at 08:44