A compromise programming method using multibounds formulation and dual approach for multicriteria structural optimization

To enhance the reliability and efficiency of the multicriteria optimization procedure, a compromise programming method using multibounds formulation (MBF) is proposed in this paper. This method can be used either to obtain the Pareto optimum set or to find the ‘best’ Pareto optimum solution in the s...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal for numerical methods in engineering Jg. 58; H. 4; S. 661 - 678
1. Verfasser: Zhang, W. H.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Chichester, UK John Wiley & Sons, Ltd 28.09.2003
Schlagworte:
ISSN:0029-5981, 1097-0207
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:To enhance the reliability and efficiency of the multicriteria optimization procedure, a compromise programming method using multibounds formulation (MBF) is proposed in this paper. This method can be used either to obtain the Pareto optimum set or to find the ‘best’ Pareto optimum solution in the sense of having the minimum distance to the utopia point. By introducing a set of artificial design variables, it is shown that a simplified and easy‐to‐use formulation can be established for practical applications. Particularly, this formulation is well adapted to the efficient dual solution approach due to the convexity of objective function. Theoretically, based on the Kuhn–Tucker optimality conditions, demonstrations show that the new formulation is equivalent to its original form and thus retains the basic properties of the latter. Numerical examples will be solved to show the capacity of this method. Copyright © 2003 John Wiley & Sons, Ltd.
Bibliographie:istex:015DE6DF204BFA99DF798BBDD4342DCEDE06729C
National Natural Science Foundation - No. 10172072
Aeronautical Foundation - No. 00B53005
ArticleID:NME864
ark:/67375/WNG-DVC61SGX-S
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0029-5981
1097-0207
DOI:10.1002/nme.864