期刊
OPTIMIZATION
卷 61, 期 5, 页码 597-616出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/02331934.2011.641546
关键词
nonlinear programming; bilevel programming; solution algorithm; Bouligand stationary solution
资金
- DAAD (Deutscher Akademischer Austausch Dienst)
In this article, we investigate the application of feasible direction method for an optimistic non-linear bilevel programming problem. The convex lower level problem of an optimistic non-linear bilevel programming problem is replaced by relaxed KKT conditions. The feasible direction method developed by Topkis and Veinott [D. M. Topkis and A. F. jun. Veinott, On the convergence of some feasible direction algorithms for nonlinear programming, SIAM J. Control Optim. 5(1967), pp. 268-279] is applied to the auxiliary problem to get a Bouligand stationary point for an optimistic bilevel programming problem.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据