%0 Journal Article
%T A Decomposition Method For Signomial Geometric Programming<br>符号几何规划的一种分解方法
%A Wang Yanjun
%A <br>王燕军
%J 系统科学与数学
%D 2006
%I 
%X In this paper, a direct decomposition method is proposed for signomial geometric programming. Through decomposition and some equivalent transformation a separable programming can be derived whose degree of nonlinearity is very low. And it is important that this method can be used to produce a kind of primal algorithm for signomial geometric programming processing large scale and high degree of difficulty. Specially each separated sub-problem is very easy to solve. Finally numerical examples are given to show the effectiveness of the method.
%K Signomial geometric programming
%K decomposition method
%K degree of difficulty<br>符号几何规划
%K 分解方法
%K 困难度
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=2FF6E32E217383E8&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=E158A972A605785F&sid=44FDB9366EDDFA2B&eid=0BD4FAD4A90498AB&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=8