首页 | 本学科首页   官方微博 | 高级检索  
     检索      

求广义几何规划全局解的近似算法
引用本文:焦红伟,任勤.求广义几何规划全局解的近似算法[J].河南师范大学学报(自然科学版),2007,35(3):212-214.
作者姓名:焦红伟  任勤
作者单位:1. 河南科技学院,数学系,河南,新乡,453003
2. 焦作师范高等专科学校,数学系,河南,焦作,454000
基金项目:河南省教育厅自然科学基金 , 河南科技学院自然科学基金
摘    要:对广泛应用于工程设计、非线性系统鲁棒稳定性分析中的广义几何规划问题(GGP)提出一线性化求解方法.使用指数变换并利用分段线性化技术转变指数项为一些带绝对值项的和,再将绝对值项线性化,最终将原问题转化为一个容易求解的线性规划问题.数值实验表明本文方法是可行的,能近似地求得(GGP)的全局最优解.

关 键 词:广义几何规划  全局优化  线性化技术  近似算法
文章编号:1000-2367(2007)03-0212-03
修稿时间:2006-10-20

An Approaximate Algorithm for Global Solution of Generalized Geometric Programming
JIAO Hong-wei,REN Qin.An Approaximate Algorithm for Global Solution of Generalized Geometric Programming[J].Journal of Henan Normal University(Natural Science),2007,35(3):212-214.
Authors:JIAO Hong-wei  REN Qin
Institution:1, Department of Mathematics, Henan Institute of Science and Technology, Xinxiang 453003, China 2. Department of Mathematics,Jiaozuo Teachers College,Jiaozuo 454000,China
Abstract:In this paper a linearization method is proposed for locating the global minimum of the generalized geometric programming(GGP),which can be applied to engineering designs and robust stability analysis of nonlinear systems.By utilizing an exponential variable transformation and piecewise linearization technique transform exponential terms into the sum of absolute terms,and absolute terms can be linearized.And finally original problem can be transformed into a linear programming problem,which can be solved easily.Numerical experiment shows that the proposed method is feasible and can be used to approximately obtain a global optimization solution of(GGP).
Keywords:generalized geometric programming  global optimization  linearization method  approaximate algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号