| 求符号线性比式和问题全局解的线性化技术 |
| |
| 引用本文： | 焦红伟,陈永强.求符号线性比式和问题全局解的线性化技术[J].西南民族学院学报(自然科学版),2008,34(2):219-222. |
| |
| 作者姓名： | 焦红伟 陈永强 |
| |
| 作者单位： | [1]河南科技学院数学系,河南新乡453003 [2]河南师范大学数学与信息科学学院,河南新乡453007 |
| |
| 摘 要： | 对符号线性比式和问题（P）提出一确定性全局优化算法。利用新的线性化技术建立了问题（P）的松弛线性规划（RLP），通过对问题（P）目标函数可行域线性松弛的逐次细分以及一系列（RLP）的求解过程，提出的分枝定界算法收敛问题（P）全局最优解．最终数值实验表明了提出方法的可行性．
|
| 关 键 词： | 符号线性比式和 全局优化 线性化技术 |
| 文章编号： | 1003-2843(2008)02-0219-04 |
| 修稿时间： | 2007年11月27 |
Linearization technique for globally solving signomial sum of linear ratios problems |
| |
| JIAO Hong-wei,CHEN Yong-qiang.Linearization technique for globally solving signomial sum of linear ratios problems[J].Journal of Southwest Nationalities College(Natural Science Edition),2008,34(2):219-222. |
| |
| Authors: | JIAO Hong-wei CHEN Yong-qiang |
| |
| Abstract: | In this paper a deterministic algorithm is proposed for globally solving signomial sum of linear ratios problems (P).By utilizing new linearization technique, the relaxation linear programming (RLP) about the (P) is established. The proposed branch and bound algorithm is convergent to the global minimum of (P) through the successive refinement of linear relaxation of the feasible region of objective function and solutions of a series of (RLP). And finally the numerical experiment is given to illustrate the feasibility of the proposed algorithm. |
| |
| Keywords: | signomial sum of linear ratios global optimization linearization technique |
| 本文献已被 维普 等数据库收录！ |
