Feasibility-Based Bounds Tightening via Fixed Points

Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ranges at every tree node. A range reduction technique often employed is called Feasibility Based Bounds Tightening, which is known to be practically fast, and is thus deployed at every node of the search tree. From time to time, however, this technique fails to converge to its limit point in finite time, thereby slowing the whole Branch-and-Bound search considerably. In this paper we propose a polynomial time method, based on solving a linear program, for computing the limit point of the Feasibility Based Bounds Tightening algorithm applied to linear equality and inequality constraints.

• Type: Journal
• Year: 2010
• Where: COCOA
• Authors: Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti
• Keywords: COCOA 2010, Discrete Geometry, Limit Point, Search Tree, Spatial Branch-and-bound Algorithm