一类求解非线性等式和不等式约束优化问题的区间算法  

An Interval Algorithm for Nonlinear Programming with Nonlinear Equality and Inequality Constraints

作　　者：黄时祥[1] 梁晓斌[1] 

机构地区：[1]上饶师范学院数学与计算机系,江西上饶334001

出　　处：《大学数学》2009年第2期120-125,共6页College Mathematics

摘　　要：在Moore二分法的基础上,通过构造的区间列L中标志矢量R的分量取值来删除部分不满足约束条件的区域,将非线性约束优化问题转化为初始域子域上的无约束优化问题,该算法可利用极大熵方法求解多目标优化问题,理论分析和数值结果均表明,这种算法是稳定且可靠的.Base on the ＂bisection rule＂ of Moore, transforming nonlinear programming with nonlinear constrains to nonlinear programming without constrains in subfield of the ruld-field by the value of components of identifiable vector R in the sequence of interval L. The algorithm could be used to solve the problem of multiobjective programming based on maximum entropy principle. Both theory and numerical analysis show that this algorithm is stable and reliable.

关 键 词：区间算法 全局约束优化 非线性函数 多目标规化 

分 类 号：O242.29[理学—计算数学] O221.2[理学—数学]