Abstract
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.
Acknowledgements
The authors are grateful to the anonymous referees for their helpful suggestions and comments that have greatly improved an earlier version of the paper.
Notes
No potential conflict of interest was reported by the authors.