摘要
在本文中 ,我们提出了双凹规划问题和更一般的广义凹规划问题 .我们给出了双凹规划问题的整体最优性条件 ,并构造了一个有限终止外逼近算法 .
In this paper, we put forward biconcave programming problem and generalized concave programming problem more generally. We give the global optimality conditions of biconcave programming programming problem and structure a outer approximation algorithm for solving the biconcave programming problem with separable linear constraints.
出处
《应用数学》
CSCD
北大核心
2002年第3期42-46,共5页
Mathematica Applicata
基金
ThisworkissupportedbyNNSFofChina(199710 6 5 )
关键词
双凹规划
广义凹规划
整体优化
外逼近方法
可分离约束
biconcave programming
generalized concave programming
global optimization
outer approximation method
separable constraints
