重庆工学院学报（自然科学版）2008，Vol.22Issue(4)：63-66,4.
一类全局优化问题的线性松弛方法
Linear Relaxation Method for a Class of Global Optimization Problems
摘要
Abstract
In this paper a linear relaxation method is proposed for a class of global optimization problem (P). By utilizing linearization technique, the relaxation linear programming (RLP) about the (P) is established, thus the initial non-convex problem (P) is reduced to a series of linear programming (RLP). The proposed algorithm is convergent to the global minimum of (P) through the successive refinement of the feasible region and solutions of a series of RLP. And finally the numerical experiment is given to illustrate the feasibility of the presented algorithm.关键词
线性松弛方法/线性规划/分枝定界Key words
linearization relaxation method/ linear programming/ branch-and-bound分类
数理科学引用本文复制引用
尹景本,薛春善..一类全局优化问题的线性松弛方法[J].重庆工学院学报（自然科学版）,2008,22(4):63-66,4.基金项目
河南科技学院自然科学基础研究项目(06055) （06055）
河南科技学院青年骨干教师资助项目(07022). （07022）
