KIT | KIT-Bibliothek | Impressum | Datenschutz

A general branch-and-bound framework for continuous global multiobjective optimization

Eichfelder, Gabriele; Kirst, Peter; Meng, Laura 1; Stein, Oliver ORCID iD icon 1
1 Institut für Operations Research (IOR), Karlsruher Institut für Technologie (KIT)


Current generalizations of the central ideas of single-objective branch-and-bound to the multiobjective setting do not seem to follow their train of thought all the way. The present paper complements the various suggestions for generalizations of partial lower bounds and of overall upper bounds by general constructions for overall lower bounds from partial lower bounds, and by the corresponding termination criteria and node selection steps. In particular, our branch-and-bound concept employs a new enclosure of the set of nondominated points by a union of boxes. On this occasion we also suggest a new discarding test based on a linearization technique. We provide a convergence proof for our general branch-and-bound framework and illustrate the results with numerical examples.

Verlagsausgabe §
DOI: 10.5445/IR/1000130839
Veröffentlicht am 23.03.2021
DOI: 10.1007/s10898-020-00984-y
Zitationen: 5
Web of Science
Zitationen: 5
Zitationen: 5
Cover der Publikation
Zugehörige Institution(en) am KIT Institut für Operations Research (IOR)
Publikationstyp Zeitschriftenaufsatz
Publikationsmonat/-jahr 05.2021
Sprache Englisch
Identifikator ISSN: 0925-5001, 1573-2916
KITopen-ID: 1000130839
Erschienen in Journal of global optimization
Verlag Springer
Band 80
Heft 1
Seiten 195–227
Vorab online veröffentlicht am 19.01.2021
Nachgewiesen in Web of Science
Relationen in KITopen
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page