2014
DOI: 10.1007/s00158-014-1057-3
|View full text |Cite
|
Sign up to set email alerts
|

An optimality criteria based method for discrete design optimization taking into account buildability constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
5
1
1

Relationship

3
4

Authors

Journals

citations
Cited by 16 publications
(4 citation statements)
references
References 32 publications
0
4
0
Order By: Relevance
“…However, the corresponding solution is not necessarily an optimum of the discrete problem; it might be sub-optimal or infeasible. Alternative approaches include heuristic optimization methods, such as the fully constrained design technique by Flager et al [27] and the discrete variant of the Optimality Criteria method by Schevenels et al [28], or metaheuristic methods.…”
Section: Nonlinear Programmingmentioning
confidence: 99%
“…However, the corresponding solution is not necessarily an optimum of the discrete problem; it might be sub-optimal or infeasible. Alternative approaches include heuristic optimization methods, such as the fully constrained design technique by Flager et al [27] and the discrete variant of the Optimality Criteria method by Schevenels et al [28], or metaheuristic methods.…”
Section: Nonlinear Programmingmentioning
confidence: 99%
“…Equation (7) ensures that the member forces are zero when profile j is not selected for member i. The displacements at predefined locations of member i are limited by the constraints given by equation (8). The stresses at predefined locations of member i are limited by the constraints given by equation (9).…”
Section: Milpmentioning
confidence: 99%
“…These include branch-and-bound for nonlinear problems, sequential linearization, dynamic rounding-off, penalty approach and various stochastic methods, among others. Some of the more recent approaches include the discrete Lagrangian-based algorithm [7], and a scheme based on the optimality criteria method [8].…”
Section: Introductionmentioning
confidence: 99%
“…These include branch-and-bound for nonlinear problems, sequential linearization, dynamic rounding-off, penalty approach and various stochastic methods, among others. Some of the more recent approaches include the discrete Lagrangian-based algorithm [5], and a scheme based on the optimality criteria method [6]. However, these methods have in common that they cannot guarantee that the global optimum is found.…”
Section: Introductionmentioning
confidence: 99%