An approximate approach of global optimization for polynomial programming problems
檔案
- 000074031900010.pdf (625.6 KB, Adobe PDF)
日期
1998-06-16
類型
期刊名稱
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷期與頁次
第 107 卷第 3 期,頁 625–632
ISSN
0377-2217
語言
英文
摘要
Many methods for solving polynomial programming problems can only find locally optimal solutions. This paper proposes a method for finding the approximately globally optimal solutions of polynomial programs. Representing a bounded continuous variable x(i) as the addition of a discrete variable d(i) and a small variable epsilon(i), a polynomial term x(i)x(j) can be expanded as the sum of d(i)x(j), d(j) epsilon(i) and epsilon(i) epsilon(j). A procedure is then developed to fully linearize d(i)x(j) and d(j) epsilon(i), and to approximately linearize epsilon(i) epsilon(j) with an error below a pre-specified tolerance. This linearization procedure can also be extended to higher order polynomial programs. Several polynomial programming examples in the literature are tested to demonstrate that the proposed method can systematically solve these examples to find the global optimum within a pre-specified error. (C) 1998 Elsevier Science B.V.
所屬典藏
期刊論文引用此條目
Li, H., & Chang, C. (1998). An approximate approach of global optimization for polynomial programming problems. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 107(3), 625–632. https://ir.lib.nycu.edu.tw/handle/11536/32559
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/32559