Journal
OPERATIONS RESEARCH LETTERS
Volume 32, Issue 2, Pages 143-151Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.orl.2003.07.003
Keywords
bilevel; fractional; quasiconcave; quasiconvex; Kth-best
Categories
Ask authors/readers for more resources
In this paper, we prove that an optimal solution to the linear fractional bilevel programming problem occurs at a boundary feasible extreme point. Hence, the Kth-best algorithm can be proposed to solve the problem. This property also applies to quasiconcave bilevel problems provided that the first level objective function is explicitly quasimonotonic. (C) 2003 Elsevier B.V. All rights reserved.
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