Multiobjective Search Algorithm with Subdivision Technique

Jahn J (2006)

Publication Type: Journal article, Original article

Publication year: 2006

Journal

Computational Optimization and Applications Springer Verlag (Germany)

Publisher: Springer Verlag (Germany)

Book Volume: 35

Pages Range: 161-175

DOI: 10.1007/s10589-006-6450-4

Abstract

This paper presents a multiobjective search algorithm with subdivision technique (MOSAST) for the global solution of multiobjective constrained optimization problems with possibly noncontinuous objective or constraint functions. This method is based on a random search method and a new version of the Graef-Younes algorithm and it uses a subdivision technique. Numerical results are given for bicriterial test problems. © 2006 Springer Science + Business Media, LLC.

Authors with CRIS profile

Johannes Jahn Professur für Angewandte Mathematik

How to cite

APA:

Jahn, J. (2006). Multiobjective Search Algorithm with Subdivision Technique. Computational Optimization and Applications, 35, 161-175. https://doi.org/10.1007/s10589-006-6450-4

MLA:

Jahn, Johannes. "Multiobjective Search Algorithm with Subdivision Technique." Computational Optimization and Applications 35 (2006): 161-175.

BibTeX: Download