双值约束非凸三次规化问题的全局最优性条件  

Global optimality conditions for non-convex cubic minimization problem with binary constraints

作　　者：张亮[1] 王燕[1] 李国权[1] 

机构地区：[1]重庆师范大学,重庆401331

出　　处：《运筹学学报》2015年第2期83-90,共8页Operations Research Transactions

基　　金：国家自然科学基金(Nos.11471062;11401064);重庆市自然科学基金(No.cstc2013jcyjA-00021)

摘　　要：考虑一类带有双值约束的非凸三次优化问题,给出了该问题的一个全局最优充分必要条件.结果改进并推广了一些文献中所给出的全局最优性条件,同时还通过数值例子来说明所给出的全局最优充要条件是容易验证的.In this paper, we consider a special non-convex cubic optimization prob- lem with binary constraints, and present a global optimal necessary and sufficient con- dition for this special non-convex cubic optimization problem, The results of this paper extend some corresponding results on global optimality conditions in some references in present information. Numerical examples show that the global optimal necessary and suf- ficient condition can effectively determine the optimal solution for the non-convex cubic optimization problem.

关 键 词：三次极小化问题 全局最优性条件 双值约束 

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