Global optimization for signomial discrete programming problems in engineering design
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
622 | en_US |
dc.citation.issue |
6 | en_US |
dc.citation.spage |
613 | en_US |
dc.citation.volume |
34 | en_US |
dc.citation.woscount |
22 | |
dc.contributor.author |
Tsai, JF | en_US |
dc.contributor.author |
Li, HL | en_US |
dc.contributor.author |
Hu, NZ | en_US |
dc.contributor.department |
資訊管理與財務金融系 註:原資管所+財金所 | zh_TW |
dc.contributor.department |
Department of Information Management and Finance | en_US |
dc.date.accessioned |
2014-12-08T15:41:40Z | |
dc.date.available |
2014-12-08T15:41:40Z | |
dc.date.issued |
2002-12-01 | en_US |
dc.description.abstract |
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. | en_US |
dc.identifier.doi |
10.1080/03052150215719 | en_US |
dc.identifier.issn |
0305-215X | en_US |
dc.identifier.journal |
ENGINEERING OPTIMIZATION | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1080/03052150215719 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/28339 | |
dc.identifier.wosnumber |
WOS:000180092100004 | |
dc.language.iso |
en_US | en_US |
dc.subject |
signomial discrete programming problem | en_US |
dc.subject |
global optimization | en_US |
dc.subject |
convexification | en_US |
dc.title |
Global optimization for signomial discrete programming problems in engineering design | en_US |
dc.type |
Article | en_US |
檔案
- 000180092100004.pdf (161.8 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
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
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/28339