Skip to Main content Skip to Navigation
Other publications

On feasibility based bounds tightening

Abstract : Mathematical programming problems involving nonconvexities are usually solved to optimality using a (spatial) Branch-and-Bound algorithm. Algorithmic e?ciency depends on many factors, among which the widths of the bounding box for the problem variables at each Branch-and-Bound node naturally plays a critical role. The practically fastest box-tightening algorithm is known as FBBT (Feasibility-Based Bounds Tightening): an iterative procedure to tighten the variable ranges. Depending on the instance, FBBT may not converge ?nitely to its limit ranges, even in the case of linear constraints. Tolerance-based termination criteria yield ?nite termination, but not in worstcase polynomial-time. We model FBBT by using ?xed-point equations in terms of the variable bounding box, and we treat these equations as constraints of an auxiliary mathematical program. We demonstrate that the auxiliary mathematical problem is a linear program, which can of course be solved in polynomial time. We demonstrate the usefulness of our approach by improving an existing Branch-and-Bound implementation. global optimization, MINLP, spatial Branch-and-Bound, range reduction.
Complete list of metadatas

Cited literature [45 references]  Display  Hide  Download

https://hal-enac.archives-ouvertes.fr/hal-00935464
Contributor : Laurence Porte <>
Submitted on : Tuesday, April 8, 2014 - 4:15:00 PM
Last modification on : Wednesday, May 6, 2020 - 5:44:10 PM
Document(s) archivé(s) le : Tuesday, July 8, 2014 - 10:46:25 AM

File

377.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00935464, version 1

Collections

Citation

Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti. On feasibility based bounds tightening. 2012. ⟨hal-00935464⟩

Share

Metrics

Record views

628

Files downloads

682