An approximate approach of global optimization for polynomial programming problems

Han-Lin Li*, Ching Ter Chang

*此作品的通信作者

研究成果: Article同行評審

36 引文 斯高帕斯(Scopus)

摘要

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 xi as the addition of a discrete variable di and a small variable εi, a polynomial term xixj can be expanded as the sum of dixj, djεi and εiεj. A procedure is then developed to fully linearize dixj and djεi, and to approximately linearize εiε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.

原文English
頁(從 - 到)625-632
頁數8
期刊European Journal of Operational Research
107
發行號3
DOIs
出版狀態Published - 16 6月 1998

指紋

深入研究「An approximate approach of global optimization for polynomial programming problems」主題。共同形成了獨特的指紋。

引用此