A new two-level linear relaxed bound method for geometric programming problems，成果详细信息-中国科技论文在线

徐成贤

63浏览
0点赞
0收藏
0分享
196下载
0评论
引用

期刊论文

A new two-level linear relaxed bound method for geometric programming problems

徐成贤， Gao Yuelina ， b ， * ， Xu Chengxianc ， Wang Yanjunc ， Zhang Lianshena

Applied Mathematics and Computation 164(2005)117-131，-0001，（）：

URL:

摘要/描述

In this paper a new two-level linear relaxed bound method is proposed for solving the global solution of geometric programming problems, and its convergent properties is proved, and a numerical example is used to illustrate the effectiveness of the presented algorithm. The bound technique in this algorithm is different from the other ones. The two-level relaxed linear programming problems of geometric programming problems are given without additional new variables and constraints by making use of the linear approximation of power functions and the new formulas for product to be unequal with sum.

关键词: Geometric programs ， Global optimization ， Linearization technique ， Branch-and-bound method ， Relaxed approximation

问答

暂无问题，成为第一个提问者

我要提问全部问题

【免责声明】以下全部内容由[徐成贤]上传于[2006年09月07日 02时00分19秒]，版权归原创者所有。本文仅代表作者本人观点，与本网站无关。本网站对文中陈述、观点判断保持中立，不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考，并请自行承担全部责任。

我要评论

全部评论 共 0 条

本学者其他成果

同领域成果