不定二次规划的全局优化算法  

Linearization Method of Global Optimization for Indefinite Quadratic Programming Problems

作　　者：蔡剑[1] 

机构地区：[1]南京航空航天大学金城学院,南京211156

出　　处：《科学技术与工程》2008年第3期612-615,共4页Science Technology and Engineering

基　　金：山东省中青年科学家奖励基金(03BS125)资助

摘　　要：对不定二次规划问题提出了一个新的确定型全局优化算法,通过对目标函数和约束函数的线性下界估计,建立了不定二次规划的松弛线性规划。通过对松弛线性规划可行域的细分,以及一系列松弛线性规划的求解过程,并通过实例证明了算法能收敛到原问题的全局最优解。Many methods for solving indefinite quadratic programming problems can only find locally optimal solutions . A method for finding the globally optimal solutions of indefinite quadratic programming problems is given. The proposed method uses a convenient linearization technique to systematically convert a indefinite quadratic programming problems into a series of relaxed linear programming problems. The example in the literature is tested to demonstrate that the proposed method can systematically solve the example to find the global optimum by solving a sequence of linear programming problems over partitioned subsets.

关 键 词：不定二次规划 线性化方法 全局优化 

分 类 号：O221.2[理学—运筹学与控制论]