| 符号几何规划的一种分解方法 |
| |
| 引用本文： | 王燕军,张可村.符号几何规划的一种分解方法[J].系统科学与数学,2006,26(4):385-394. |
| |
| 作者姓名： | 王燕军 张可村 |
| |
| 作者单位： | 1. 上海财经大学应用数学系,上海,200433
2. 西安交通大学理学院,西安,710049 |
| |
| 摘 要： | 针对符号几何规划提出了一种直接的分解方法,将难于求解的符号几何规划问题等价地转化为一个非线性程度很低的可分离规划,为寻求困难度高且规模较大的符号几何规划问题的求解提供了一种方法,特别是经此方法分解后的每个子问题均易于求解,最后给出了数值实例,验证了此方法的有效性．
|
| 关 键 词： | 符号几何规划 分解方法 困难度 |
| 修稿时间： | 2005年7月28日 |
A Decomposition Method For Signomial Geometric Programming |
| |
| Wang Yanjun,Zhang Kecun.A Decomposition Method For Signomial Geometric Programming[J].Journal of Systems Science and Mathematical Sciences,2006,26(4):385-394. |
| |
| Authors: | Wang Yanjun Zhang Kecun |
| |
| Institution: | Department of Applied Mathematics, Shanghai University of Finance and Economics, Shanghai 200433 |
| |
| Abstract: | 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. |
| |
| Keywords: | Signomial geometric programming decomposition method degree of difficulty |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《系统科学与数学》浏览原始摘要信息 |
| 点击此处可从《系统科学与数学》下载免费的PDF全文 |
|
