.png){kind=icon}
返回
A new linearization method for generalized linear multiplicative programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2010.10.016.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a deterministic global optimization algorithm for solving generalized linear multiplicative programming (GLMP). In this algorithm, a new linearization method is proposed, which applies more information of the function of (GLMP) than some other methods. By using this new linearization technique, the initial nonconvex problem is reduced to a sequence of linear programming problems. A deleting rule is presented to improve the convergence speed of this algorithm. The convergence of this algorithm is established, and some experiments are reported to show the feasibility and efficiency of this algorithm. (C) 2010 Elsevier Ltd. All rights reserved.
Keyword:
Global optimization
Multiplicative programming
Linear relaxation
Branch and bound
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
The role of surgery in ovarian cancer with special emphasis on cytoreductive surgery for recurrence
PREAI
分享收藏
分享收藏
Influence of vitamin C or/and L-methionine on hyperglycaemia, hyperlipidaemia and hematological alterations in alloxan-induced diabetes in rats维生素C或/和L-蛋氨酸对四氧嘧啶诱导的糖尿病大鼠高血糖、高脂血症及血液学改变的影响.png)
IF0
PREAI
分享收藏分享收藏
查看更多内容