Hostname: page-component-5db58dd55d-l8wb7 Total loading time: 0 Render date: 2026-06-01T15:47:04.441Z Has data issue: false hasContentIssue false

Deterministic global optimization using interval constraint propagation techniques

Published online by Cambridge University Press:  15 December 2004

Frederic Messine*
Affiliation:
Laboratoire de Mathématiques Appliquées, FRE 2570, Université de Pau et des Pays de l'Adour, UFR Sciences et Techniques, Département d'Informatique, BP 1155, 64013 Pau Cedex, France; Frederic.Messine@univ-pau.fr; messine@leei.enseeiht.fr.
Get access

Abstract

The purpose of this article is to show the great interest of theuse of propagation (or pruning) techniques, inside classicalinterval Branch-and-Bound algorithms. Therefore, a propagationtechnique based on the construction of the calculus tree isentirely explained and some properties are presented without theneed of any formalism (excepted interval analysis). This approachis then validated on a real example: the optimal design of anelectrical rotating machine.

Information

Type
Research Article
Copyright
© EDP Sciences, 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable