標題: Global optimization for signomial discrete programming problems in engineering design
作者: Tsai, JF
Li, HL
Hu, NZ
資訊管理與財務金融系 註:原資管所+財金所
Department of Information Management and Finance
關鍵字: signomial discrete programming problem;global optimization;convexification
公開日期: 1-Dec-2002
摘要: 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.
URI: http://dx.doi.org/10.1080/03052150215719
http://hdl.handle.net/11536/28339
ISSN: 0305-215X
DOI: 10.1080/03052150215719
期刊: ENGINEERING OPTIMIZATION
Volume: 34
Issue: 6
起始頁: 613
結束頁: 622
Appears in Collections:Articles


Files in This Item:

  1. 000180092100004.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.