| 求解一类比式规划问题的确定性算法 |
| |
| 引用本文： | 焦红伟,郭运瑞,陈永强.求解一类比式规划问题的确定性算法[J].云南民族大学学报(自然科学版),2008,17(2):106-109. |
| |
| 作者姓名： | 焦红伟 郭运瑞 陈永强 |
| |
| 作者单位： | 1. 河南科技学院数学系,河南新乡,453003
2. 河南师范大学数学与信息科学学院,河南新乡,453007 |
| |
| 基金项目： | 国家自然科学基金
,
河南科技学院自然科学基础计划研究项目 |
| |
| 摘 要： | 对一类比式规划问题(P)提出一确定性全局优化算法.利用线性化技术建立了问题(P)的松弛线性规划(RLP),通过对目标函数线性松弛可行域的逐次细分以及一系列(RLP)的求解过程,提出的算法收敛问题(P)全局最优解.最终数值实验表明了提出方法的可行性.
|
| 关 键 词： | 比式规划 全局优化 线性化技术 分枝定界 fractional programming global optimization linearization technique branch-and-bound 求解 比式 规划问题 确定性算法 Problems Programming Fractional Series numerical experiment feasibility linearization feasible region objective function solutions convergent global minimum established technique relaxation |
| 文章编号： | 1672-8513(2008)02-0106-03 |
| 修稿时间： | 2007年12月3日 |
A Deterministic Algorithm for Solving a Series of Fractional Programming Problems |
| |
| Jiao Hongwei,Guo Yunrui,Chen Yongqiang.A Deterministic Algorithm for Solving a Series of Fractional Programming Problems[J].Journal of Yunnan Nationalities University:Natural Sciences Edition,2008,17(2):106-109. |
| |
| Authors: | Jiao Hongwei Guo Yunrui Chen Yongqiang |
| |
| Abstract: | In this paper a deterministic algorithm is proposed for a global solving of a series of fractional pro-gramming problems(P).By utilizing linearization technique the relaxation linear programming(RLP)about the(P)is established.The proposed algorithm is convergent to the global minimum of(P)through the successive re-finement of linear relaxation of the feasible region of objective function and solutions of a series of RLP.And finaUy the numerical experiment is given to illustrate the feasibility of the presented algorithm. |
| |
| Keywords: | fractional programming global optimization linearization technique branch-and-bound |
| 本文献已被 维普 万方数据 等数据库收录！ |
