Global Optima for Size Optimization Benchmarks by Branch and Bound Principles

Adéla Pospíšilová, Matej Lepš

Abstract


This paper searches for global optima for size optimization benchmarks utilizing a method based on branch and bound principles. The goal is to demonstrate the process for finding these global optima on the basis of two examples. A suitable parallelization strategy is used in order to minimize the computational demands. Optima found in the literature are compared with the optima used in this work.

Keywords


benchmarks; discrete sizing optimization; branch and bound method; global optima; parallel programming

Full Text: PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

ISSN 1210-2709 (Print)
ISSN 1805-2363 (Online)
Published by the Czech Technical University in Prague