Global optimization for signomial discrete programming problems in engineering design

檔案

日期

2002-12-01

類型

期刊名稱

ENGINEERING OPTIMIZATION

卷期與頁次

第 34 卷第 6 期,頁 613–622

ISSN

0305-215X

語言

英文

摘要

This paper proposes a novel method to solve signomial discrete programming (SDP) problems frequently occurring in engineering design. Various signomial terms are first convexified following different strategies. The! original SDP program is then converted into a convex integer program solvable by commercialized packages to obtain globally optimal solutions. Compared with current SDP methods, the proposed method is guaranteed to converge to a global optimum, is computationally more efficient, and is capable of treating zero boundary problems. Numerical examples are presented to demonstrate the usefulness of the proposed method in engineering design.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Tsai, J., Li, H., & Hu, N. (2002). Global optimization for signomial discrete programming problems in engineering design. ENGINEERING OPTIMIZATION, 34(6), 613–622. https://doi.org/10.1080/03052150215719

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/28339