首页 | 本学科首页   官方微博 | 高级检索  
     

一类优化问题的确定性算法
引用本文:陈荣江,焦红伟,陈永强. 一类优化问题的确定性算法[J]. 河南科学, 2007, 25(3): 345-347
作者姓名:陈荣江  焦红伟  陈永强
作者单位:河南科技学院,数学系,河南,新乡,453003;河南师范大学,数学与信息科学学院,河南,新乡,453007
基金项目:国家自然科学基金 , 河南科技学院自然科学基础研究计划项目
摘    要:对广泛应用于工程设计中的一类线性比式和问题(P)提出了一确定性全局优化算法,利用等价问题和新的线性化技术给出了问题(P)的松弛线性规划(RLP,)通过对(RLP)可行域的细分以及一系列(RLP)的求解过程,提出分枝定界算法收敛到问题(P)的全局最优解,最终数值实验表明所提方法的可行性.

关 键 词:线性比式和  全局优化  确定性算法  线性化技术
文章编号:1004-3918(2007)03-0345-03
修稿时间:2007-02-12

Deterministic Algorithm for a Class of Optimization Problem
CHEN Rong-jiang,JIAO Hong-wei,CHEN Yong-giang. Deterministic Algorithm for a Class of Optimization Problem[J]. Henan Science, 2007, 25(3): 345-347
Authors:CHEN Rong-jiang  JIAO Hong-wei  CHEN Yong-giang
Affiliation:1. Department of Mathematics, Henan Institute of Science and Technology, Xinxiang 453003, China; 2. College of Mathematics and Information Science, Henan Normal University, Xinxiang 453007, China
Abstract:In this paper a global optimization algorithm is proposed for locating global minimum of a class of sum of linear ratios problem(P),which can be applied to engineering designs.By utilizing equivalent problem and linearization technique,the relaxation linear programming(RLP)about problem(P)is established,thus the initial nonconvex problem(P)is reduced to a series of linear programming(RLP).The proposed branch and bound algorithm is convergent to the global minimum of problem(P) through the successive refinement of the feasible region and solutions of RLP.And finally the numerical experiment is given to illustrate the feasibility of the presented algorithm.
Keywords:sum of linear ratios  clobal optimization  deterministic algorithm  linearization technique
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号