Journal
OPTIMIZATION
Volume 61, Issue 5, Pages 597-616Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/02331934.2011.641546
Keywords
nonlinear programming; bilevel programming; solution algorithm; Bouligand stationary solution
Funding
- DAAD (Deutscher Akademischer Austausch Dienst)
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
