Multiobjective Search Algorithm with Subdivision Technique

Journal article
(Original article)


Publication Details

Author(s): Jahn J
Journal: Computational Optimization and Applications
Publisher: Springer Verlag (Germany)
Publication year: 2006
Volume: 35
Pages range: 161-175
ISSN: 0926-6003


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.



FAU Authors / FAU Editors

Jahn, Johannes Prof. Dr.
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://dx.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: 

Last updated on 2018-01-07 at 04:23