Abstract
A naturalway to define branching in Branch-and-Bound for blending problemis to do bisection. The
disadvantage of bisectioning is that partition sets are in general irregular. A regular simplex with
fixed orientation can be determined by its center and size, allowing storage savings in a Branchand-
Bound algorithm from computational perspective. Unfortunately for dimension n>3 a regular
simplex cannot be covered by regular subsimplices without overlapping. The possible difficulties of
the refinement by regular simplices are studied here. The main challenge is to find a refinement with
a good convergence ratio which facilitates the discarding of simplices in an overlapped and already
evaluated region.
Original language | English |
---|---|
Title of host publication | Proceedings of the XII Global Optimization Workshop MAGO 2014 Mathematical and applied global optimization |
Editors | L.G. Casado, I. García, E.M.T. Hendrix |
Publisher | Universidad de Almería |
Pages | 93-96 |
ISBN (Print) | 9788416027576 |
Publication status | Published - 2014 |
Event | MAGO 2014, Málaga, Spain - Duration: 1 Sept 2014 → 4 Sept 2014 |
Conference/symposium
Conference/symposium | MAGO 2014, Málaga, Spain |
---|---|
Period | 1/09/14 → 4/09/14 |