.png){kind=icon}
返回
A global optimization method for nonconvex separable programming problems
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(98)00243-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
goal programming
piecewise linear function
separable programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
An approximate approach of global optimization for polynomial programming problems多项式规划问题全局优化的一种近似方法
PREAI
分享收藏分享收藏 没有更多内容
没有更多内容