Optimal Multisections in Interval Branch-and-Bound Methods of Global Optimization

2004 ◽  
Vol 30 (1) ◽  
pp. 23-38 ◽  
Author(s):  
Jean-Louis Lagouanelle ◽  
Gérard Soubry
2008 ◽  
Vol 13 (1) ◽  
pp. 145-159 ◽  
Author(s):  
J. Žilinskas

Branch and bound methods for global optimization are considered in this paper. Advantages and disadvantages of simplicial partitions for branch and bound are shown. A new general combinatorial approach for vertex triangulation of hyper‐rectangular feasible regions is presented. Simplicial partitions may be used to vertex triangulate feasible regions of non rectangular shape defined by linear inequality constraints. Linear inequality constraints may be used to avoid symmetries in optimization problems.


2011 ◽  
Vol 56 (3) ◽  
pp. 821-844 ◽  
Author(s):  
José L. Berenguel ◽  
L. G. Casado ◽  
I. García ◽  
Eligius M. T. Hendrix

Sign in / Sign up

Export Citation Format

Share Document