Three Enhancements for Optimization-Based Bound Tightening

epub ahead of print
  • Optimization-based bound tightening (OBBT) is one of the most effective procedures to reduce variable domains of nonconvex mixed-integer nonlinear programs (MINLPs). At the same time it is one of the most expensive bound tightening procedures, since it solves auxiliary linear programs (LPs)—up to twice the number of variables many. The main goal of this paper is to discuss algorithmic techniques for an efficient implementation of OBBT. Most state-of-the-art MINLP solvers apply some restricted version of OBBT and it seems to be common belief that OBBT is beneficial if only one is able to keep its computational cost under control. To this end, we introduce three techniques to increase the efficiency of OBBT: filtering strategies to reduce the number of solved LPs, ordering heuristics to exploit simplex warm starts, and the generation of Lagrangian variable bounds (LVBs). The propagation of LVBs during tree search is a fast approximation to OBBT without the need to solve auxiliary LPs. We conduct extensive computational experiments on MINLPLib2. Our results indicate that OBBT is most beneficial on hard instances, for which we observe a speedup of 17% to 19% on average. Most importantly, more instances can be solved when using OBBT.

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Ambros M. Gleixner, Timo Berthold, Benjamin Müller, Stefan Weltge
Document Type:Article
Parent Title (English):Journal of Global Optimization
Year of first publication:2016
Preprint:urn:nbn:de:0297-zib-57803
DOI:https://doi.org/10.1007/s10898-016-0450-4