A global optimization method for nonconvex separable programming problems

檔案

日期

1999-09-01

作者

類型

期刊名稱

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

卷期與頁次

第 117 卷第 2 期,頁 275–292

ISSN

0377-2217

語言

英文

摘要

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. (C) 1999 Elsevier Science B.V. All rights reserved.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Li, H., & Yu, C. (1999). A global optimization method for nonconvex separable programming problems. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 117(2), 275–292. https://doi.org/10.1016/S0377-2217(98)00243-4

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/31124