Branch and bound with simplicial partitions for global optimization
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.
First Published Online: 14 Oct 2010
Keywords:
global optimization, branch and bound, simplicial partitionsHow to Cite
Share
License
Copyright (c) 2008 The Author(s). Published by Vilnius Gediminas Technical University.
This work is licensed under a Creative Commons Attribution 4.0 International License.
View article in other formats
Published
Issue
Section
Copyright
Copyright (c) 2008 The Author(s). Published by Vilnius Gediminas Technical University.
License
This work is licensed under a Creative Commons Attribution 4.0 International License.