A new global approach for 0-1 polynomial programs

Han-Lin Li*

*Corresponding author for this work

研究成果: Article同行評審

2 引文 斯高帕斯(Scopus)

摘要

Given a 0-1 polynomial expression Σk = 1 N - 1Σm = k + 1 Nxkxm, where xk and xm are 0-1 variables, the famous Glover and Woolsey method required to use N(N - l) 2 additional continuous variables and 2N(N - 1) linear constraints to transform this expression into a linear form. This paper proposes a method which first reformulates the above expression as a new expression Σk = 1 Nxkyk, yk = Σm = k + 1 Nxm; then to transform the expression into a linear form where xk and yk are separated. The proposed transformation method only required to use 2(N - 1) additional continuous variables and 8(N - 1) linear constraints. Based on the new transformation, a 0-1 polynomial program can be more effectively solved to obtain a global optimum.

原文English
頁(從 - 到)319-327
頁數9
期刊Computers and Operations Research
21
發行號3
DOIs
出版狀態Published - 1 一月 1994

指紋 深入研究「A new global approach for 0-1 polynomial programs」主題。共同形成了獨特的指紋。

引用此