.png){kind=icon}
返回
Linearization method of global optimization for generalized geometric programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2003.12.101.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Many methods for solving generalized geometric programming (GGP) problem can only find locally optimal solutions. But up to now, less work has been devoted to solving global optimization of GGP due to the inherent difficulty. This paper gives a method for finding the globally optimal solutions of GGP. Utilizing an exponentially variable transformation and some other techniques the initial nonlinear and nonconvex GGP problem is reduced to a sequence of linear programming problems. The proposed algorithm is proven that it is convergent to the global minimum through the solutions of a series of linear programming problems. Several GGP examples in the literatures are tested to demonstrate that the proposed method can systematically solve these examples to find the global optimum within a prespecified error. (C) 2004 Elsevier Inc. All rights reserved.
Keyword:
generalized geometric programming
global optimization
linearization
branch-and-bound
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
分享收藏Multi-item inventory model with quantity-dependent inventory costs and demand-dependent unit cost under imprecise objective and restrictions: a geometric programming approach不精确目标和限制条件下具有数量依赖库存成本和需求依赖单位成本的多物品库存模型: 几何规划方法
PREAI
分享收藏
查看更多内容