Branch and bound with simplicial partitions for global optimization

By Julius Zilinskas. 2008

60 citations recorded by the source corpus.

Abstract 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.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/1c2f9c9991fa5ba7080b348741c0233f29d9eb27