2003
DOI: 10.1002/nme.864
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: SUMMARYTo enhance the reliability and e ciency 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 ÿnd the 'best' Pareto optimum solution in the sense of having the minimum distance to the utopia point. By introducing a set of artiÿcial design variables, it is shown that a simpliÿed and easy-to-use formulation can be established for practical applications… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(8 citation statements)
references
References 12 publications
0
8
0
Order By: Relevance
“…It is less computationally intensive and avoids decision makers' choices (Gan et al, 1996). The major strength of CP is to find the real Pareto optimum curve when the optimal points are heterogeneously distributed, a task that the conventional weighting methods are failed to do (Zhang, 2003). Statistical measures fail when the gridded data over-and underestimate in-situ data simultaneously.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…It is less computationally intensive and avoids decision makers' choices (Gan et al, 1996). The major strength of CP is to find the real Pareto optimum curve when the optimal points are heterogeneously distributed, a task that the conventional weighting methods are failed to do (Zhang, 2003). Statistical measures fail when the gridded data over-and underestimate in-situ data simultaneously.…”
Section: Discussionmentioning
confidence: 99%
“…It is used to analyze multi-objective problems based on the concept of choosing a solution from a set of solutions considering the nearest to the optimum points (Zeleny, 1973). Its strength over the conventional weighting approach is that it measures the minimum distance Pareto optimal point, especially when the distribution of the points is nonlinear (Zhang, 2003). CP was originally introduced by Zeleny (1973) and later used by many researchers related to their fields of studies, including analyzing hydrological and environmental issues (Brahim and Duckstein, 2011).…”
Section: Introductionmentioning
confidence: 99%
“…Zhang [132] presents an improved method of compromise programming, supplemented with a multifrontier formulation. It is successfully applied to optimize various structural problems, both truss bar structures and plates modeled with finite elements.…”
Section: Classic Optimizationmentioning
confidence: 99%
“…Other methods include goal programming (Zou and Mahadevan, 2006), compromise decision support problem Mistree, 1993, 1995;Chen et al, 1996), compromise programming (CP) (Zalney, 1973;Zhang, 2003;Chen et al, 1999) and physical programming (Messac, 1996;Messac et al, 2001;Messac and Ismail-Yahaya, 2002;Chen et al, 2000). Each of these methods has its own advantages and limitations.…”
Section: Multi-objective Optimizationmentioning
confidence: 99%