Global Optimization for a Class of Multiplicative Programming with Ezponent

摘要：

In this paper a global optimization algorithm based on a new linearizing method for multiplicative programming with exponent (MPE). By utilizing the new linearizing method initial non-convex nonlinear problem MPE is reduce to a sequence of linear programming problems through the successive refinement of a linear relaxation of feasible region and of the objective function. The proposed algorithM is proven that it is convergent to the global minimuM of MPE through the solutions of a series of linear programming problems.

关键词： MPE Linearization relazation Branch and bound

作者: Xuegang Zhou Kun Wu

作者单位: School of Mathematical Science and Computing Technology, Center South University,Hunan 100039, P.R. School of Mathematical Science and Computing Technology, Center South University,Hunan 100039,P.R. C

会议类型: 国际会议

会议名称: The First World Congress on Global Optimization in Engineering & Science(第一届工程与科学全局优化国际会议 WCGO2009)

会议地点: 长沙

会议语种:英文

页码: 223-228

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