Journal
OPTIMIZATION
Volume 65, Issue 7, Pages 1437-1449Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/02331934.2016.1154553
Keywords
Bilevel programming; pessimistic solution; Kth-Best algorithm
Funding
- National Natural Science Foundation of China [11501233, 71471140, 71171150, 71103135]
Ask authors/readers for more resources
In this paper, we study the weak linear bilevel programming problems. For such problems, under some conditions, we first conclude that there exists a solution which is a vertex of the constraint region. Based on the classical Kth-Best algorithm, we then present a solution approach. Finally, an illustrative example shows that the proposed approach is feasible.
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