Global optimization method for nonconvex separable programming problems

Han-Lin Li, Chian Son Yu

研究成果: Article同行評審

37 引文 斯高帕斯(Scopus)

摘要

Conventional methods of solving nonconvex separable programming (NSP) problems by mixed integer programming methods requires adding numerous 0-1 variables. In this work, we present a new method of deriving the global optimum of a NSP program using less number of 0-1 variables. A separable function is initially expressed by a piecewise linear function with summation of absolute terms. Linearizing these absolute terms allows us to convert a NSP problem into a linearly mixed 0-1 program solvable for reaching a solution which is extremely close to the global optimum.

原文English
頁(從 - 到)275-292
頁數18
期刊European Journal of Operational Research
117
發行號2
DOIs
出版狀態Published - 1 9月 1999

指紋

深入研究「Global optimization method for nonconvex separable programming problems」主題。共同形成了獨特的指紋。

引用此