11th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference 2006
DOI: 10.2514/6.2006-6975
|View full text |Cite
|
Sign up to set email alerts
|

An Application of Analytical Multi-Objective Optimization to Truss Structures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(7 citation statements)
references
References 7 publications
0
7
0
Order By: Relevance
“…and therefore the solution is either an active constraint or the Pareto-optimal set of the unconstrained problem [18]. In fact, if the problem is unconstrained, the L matrix is L = ∇F and the solution is given by det(∇F) = 0 (42)…”
Section: Discussionmentioning
confidence: 99%
“…and therefore the solution is either an active constraint or the Pareto-optimal set of the unconstrained problem [18]. In fact, if the problem is unconstrained, the L matrix is L = ∇F and the solution is given by det(∇F) = 0 (42)…”
Section: Discussionmentioning
confidence: 99%
“…The condition is also sufficient if the objective functions and the constraints are convex or pseudoconvex 24,25 Equation (30) can be rearranged in a matrix form as 14,26 L…”
Section: Theoretical Backgroundmentioning
confidence: 99%
“…and therefore the solution is either an active constraint or the Pareto optimal set of the unconstrained problem. 26 In fact, if the problem is unconstrained, the L matrix is L ¼ rF and the solution is given by…”
Section: Theoretical Backgroundmentioning
confidence: 99%
“…The following theoretical procedure for the analytical derivation of the Pareto-optimal set has been presented in Gobbi et al (2015) and Levi and Gobbi (2006) along with mathematical examples and the analytical solution of the optimal design of a beam of rectangular section subjected to bending. Here, the procedure is summarized.…”
Section: Analytical Derivation Of the Pareto-optimal Setmentioning
confidence: 99%
“…and therefore the solution is either an active constraint or the Pareto optimal set of the unconstrained problem (Levi and Gobbi 2006). In fact, if the problem is unconstrained, the L matrix is L = ∇F and the solution is given by det (∇F) = 0 (3.12)…”
Section: Fritz John Necessary Conditionmentioning
confidence: 99%