Feasibility-Based Bounds Tightening via Fixed Points

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.

[1]  Martin W. P. Savelsbergh,et al.  Preprocessing and Probing Techniques for Mixed Integer Programming Problems , 1994, INFORMS J. Comput..

[2]  Andrea Lodi,et al.  Experiments with a Feasibility Pump Approach for Nonconvex MINLPs , 2010, SEA.

[3]  Pierre Hansen,et al.  Formulation symmetries in circle packing , 2010, Electron. Notes Discret. Math..

[4]  Hermann Schichl,et al.  Interval Analysis on Directed Acyclic Graphs for Global Optimization , 2005, J. Glob. Optim..

[5]  Nikolaos V. Sahinidis,et al.  A Finite Algorithm for Global Minimization of Separable Concave Programs , 1998, J. Glob. Optim..

[6]  Edward M. B. Smith,et al.  A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs , 1999 .

[7]  Nikolaos V. Sahinidis,et al.  Global optimization of mixed-integer nonlinear programs: A theoretical and computational study , 2004, Math. Program..

[8]  Moshe Y. Vardi,et al.  An Analysis of Slow Convergence in Interval Propagation , 2007, CP.

[9]  Ernest Davis,et al.  Constraint Propagation with Interval Labels , 1987, Artif. Intell..

[10]  Leo Liberti,et al.  Branching and bounds tighteningtechniques for non-convex MINLP , 2009, Optim. Methods Softw..

[11]  C. C. Pantelides,et al.  Novel methods for the efficient evaluation of stored mathematical expressions on vector computers , 2000 .

[12]  Christian Bessière.  Principles and Practice of Constraint Programming - CP 2007, 13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007, Proceedings , 2007, CP.

[13]  Boi Faltings,et al.  Arc-Consistency for Continuous Variables , 1994, Artif. Intell..

[14]  Patrick Henry Winston,et al.  The psychology of computer vision , 1976, Pattern Recognit..

[15]  David L. Waltz,et al.  Understanding Line drawings of Scenes with Shadows , 1975 .

[16]  Garth P. McCormick,et al.  Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..

[17]  Leo Liberti,et al.  Writing Global Optimization Software , 2006 .

[18]  Hermann Schichl,et al.  Interval propagation and search on directed acyclic graphs for numerical constraint solving , 2009, J. Glob. Optim..

[19]  Vittorio Maniezzo,et al.  Matheuristics: Hybridizing Metaheuristics and Mathematical Programming , 2009 .

[20]  Nenad Mladenovic,et al.  A Good Recipe for Solving MINLPs , 2010, Matheuristics.

[21]  N. Maculan,et al.  Global optimization : from theory to implementation , 2006 .

[22]  Erling D. Andersen,et al.  Presolving in linear programming , 1995, Math. Program..

[23]  Sonia Cafieri,et al.  The Reformulation-Optimization Software Engine , 2010, ICMS.

[24]  Steven Roman,et al.  Lattices and ordered sets , 2008 .

[25]  Leo Liberti,et al.  Optimal running and planning of a biomass-based energy production process , 2008 .

[26]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[27]  Michael R. Bussieck,et al.  MINLPLib - A Collection of Test Models for Mixed-Integer Nonlinear Programming , 2003, INFORMS J. Comput..

[28]  Leo Liberti,et al.  Reformulations in Mathematical Programming: Definitions and Systematics , 2009, RAIRO Oper. Res..

[29]  A. Neumaier,et al.  A global optimization method, αBB, for general twice-differentiable constrained NLPs — I. Theoretical advances , 1998 .

[30]  Sonia Cafieri,et al.  On convex relaxations of quadrilinear terms , 2010, J. Glob. Optim..

[31]  John Rischard Rice,et al.  Mathematical Software , 1971 .

[32]  Sonia Cafieri,et al.  Reformulations in Mathematical Programming: A Computational Approach , 2009, Foundations of Computational Intelligence.

[33]  John N. Hooker,et al.  Integrated methods for optimization , 2011, International series in operations research and management science.

[34]  Hanif D. Sherali,et al.  On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems , 1999, SIAM J. Optim..

[35]  N. T. Hoai-Phuong,et al.  Optimization under Composite Monotonic Constraints and Constrained Optimization over the Efficient Set , 2006 .

[36]  R. Baker Kearfott,et al.  Introduction to Interval Analysis , 2009 .