期刊
OPERATIONS RESEARCH LETTERS
卷 32, 期 2, 页码 143-151出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.orl.2003.07.003
关键词
bilevel; fractional; quasiconcave; quasiconvex; Kth-best
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据