摘要
关于一类非线性二层规划的求解的研究。首先利用K-T条件及罚函数法[1]转化模型,然后用Frank-W olfe线性逼近算法[2]求解。
In this paper, the algorithms for a class of no-linear bilevel convex programming was studied. First, transformed the model by the K-T conditions and the penalty function, then got the solution by Frank-Wolfe algorithms.
出处
《江西科学》
2009年第6期784-785,831,共3页
Jiangxi Science
