Finding all global optima of engineering design problems with discrete signomial terms

Tsai, Jung‐Fa; Lin, Chia-Chen; Peng, Lei-Yi

doi:10.1080/0305215x.2019.1577404

Cited by 1 publication

(1 citation statement)

References 49 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, Lin et al [21] proposed a novel method based on the Li et al [16] method to further decrease the constraints required in linearizing the discrete signomial term and efficiently treated the three-dimensional open-dimension rectangular packing problems. Tsai et al [22] applied the Li et al [23] method to solve the engineering design problems with discrete signomial terms. Lu [24] also proposed a similar approach for solving the product of free-sign discrete functions.…”

Section: Introductionmentioning

confidence: 99%

Global Optimization for Mixed–Discrete Structural Design

2020

Self Cite

View full text Add to dashboard Cite

Several structural design problems that involve continuous and discrete variables are very challenging because of the combinatorial and non-convex characteristics of the problems. Although the deterministic optimization approach theoretically guarantees to find the global optimum, it usually leads to a significant burden in computational time. This article studies the deterministic approach for globally solving mixed–discrete structural optimization problems. An improved method that symmetrically reduces the number of constraints for linearly expressing signomial terms with pure discrete variables is applied to significantly enhance the computational efficiency of obtaining the exact global optimum of the mixed–discrete structural design problem. Numerical experiments of solving the stepped cantilever beam design problem and the pressure vessel design problem are conducted to show the efficiency and effectiveness of the presented approach. Compared with existing methods, this study introduces fewer convex terms and constraints for transforming the mixed–discrete structural problem and uses much less computational time for solving the reformulated problem to global optimality.

show abstract