A Deterministic Global Optimization Algorithm for Design Problems

Frédéric Messine

Chapter Chapter 10 in Essays and Surveys in Global Optimization, 2005, pp 267-294 from Springer

Abstract: Abstract Complete extensions of standard deterministic Branch-and-Bound algorithms based on interval analysis are presented hereafter in order to solve design problems which can be formulated as non-homogeneous mixed-constrained global optimization problems. This involves the consideration of variables of different kinds: real, integer, logical or categorical. In order to solve interesting design problems with an important number of variables, some accelerating procedures must be introduced in these extended algorithms. They are based on constraint propagation techniques and are explained in this chapter. In order to validate the designing methodology, rotating machines with permanent magnets are considered. The corresponding analytical model is recalled and some global optimal design solutions are presented and discussed.

Keywords: Global Optimization; Design Problem; Permanent Magnet; Interval Analysis; Inclusion Function (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (4)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-25570-5_10

Ordering information: This item can be ordered from
http://www.springer.com/9780387255705

DOI: 10.1007/0-387-25570-2_10

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().