Optimization Algorithm for Solving a Kind of Mathematical Problems

摘要：

　　In this paper,we develop an algorithm to globally solve a kind of mathematical problem.Firstly,by utilizing equivalent problem and linear relaxation method,a linear relaxation programming of original problem is established.Secondly,by using branch and bound technique,a determined global optimization algorithm is proposed for solving equivalent problem.Finally,the convergence of the proposed algorithm is proven and numerical examples showed that the presented algorithm is feasible to solve the kind of mathematical problems.

关键词： optimization method relaxation method branch and bound technique

作者: Hongwei Jiao Kun Li

作者单位: Department of Mathematics, Henan Institute of Science and Technology, Xinxiang 453003, China Henan Mechanical and Electrical Engineering College, Xinxiang 453002, China

会议类型: 国际会议

会议名称: the 2010 International Conference on Frontiers of Manufacturing and Design Science(第一届制造与设计科学国际会议(ICFMD 2010))

会议地点: 重庆

会议语种:英文

页码: 3423-3426

在线出版日期: 2010-12-11（万方平台首次上网日期，不代表论文的发表时间）