.png){kind=icon}
返回
Range division and contraction algorithm for a class of global optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2014.05.024.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article presents a range division and contraction algorithm for a class of global optimization problems. In the algorithm, the original problem is first converted into an equivalent monotonic optimization problem whose objective function is just a simple univariate. By exploiting the particularity of this monotonicity, the variable bound in a particular node is then tightened and the bounds on the constraints are calculated to remove the region which doesn't contain optimal solutions. The proposed method can reach an approximate solution within an acceptable error, in which such solution is adequately guaranteed to be feasible and to be close to the actual global optimal solution. Several numerical examples are given to illustrate the feasibility and efficiency of the present algorithm. (C) 2014 Elsevier Inc. All rights reserved.
Keyword:
Global optimization
Monotonic function
Range contraction
(epsilon, eta)-optimal solution
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
分享收藏A global optimization using linear relaxation for generalized geometric programming使用线性松弛进行广义几何规划的全局优化
PREAI
分享收藏
Multi-item inventory model with quantity-dependent inventory costs and demand-dependent unit cost under imprecise objective and restrictions: a geometric programming approach不精确目标和限制条件下具有数量依赖库存成本和需求依赖单位成本的多物品库存模型: 几何规划方法
PREAI
分享收藏Effectiveness of a geometric programming algorithm for optimization of machining economics models
PREAI
分享收藏
查看更多内容