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

Gabriele Eichfelder, Peter Kirst, Laura Meng, Oliver Stein*

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

11 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)195-227
JournalJournal of Global Optimization
Issue number1
Early online date19 Jan 2021
Publication statusPublished - 2021


  • Branch-and-bound algorithm
  • Enclosure
  • Global optimization
  • Multiobjective optimization
  • Nonconvex optimization


Dive into the research topics of 'A general branch-and-bound framework for continuous global multiobjective optimization'. Together they form a unique fingerprint.

Cite this