期刊
JOURNAL OF GLOBAL OPTIMIZATION
卷 44, 期 3, 页码 313-337出版社
SPRINGER
DOI: 10.1007/s10898-008-9325-7
关键词
Bilevel programming; Nonconvex programming; DC programming; DCA; Global optimization; Branch and bound techniques
We propose a method for finding a global solution of a class of nonlinear bilevel programs, in which the objective function in the first level is a DC function, and the second level consists of finding a Karush-Kuhn-Tucker point of a quadratic programming problem. This method is a combination of the local algorithm DCA in DC programming with a branch and bound scheme well known in discrete and global optimization. Computational results on a class of quadratic bilevel programs are reported.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据