Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.orl.2003.07.003 | Oper. Res. Lett. |
Keywords | Field | DocType |
k th-best,quasiconvex,quasiconcave,fractional,optimal solution,bilevel problem,bilevel,level objective function,linear fractional bilevel programming,boundary feasible extreme point,kth-best algorithm,objective function,bilevel programming,extreme point | Extreme point,Mathematical optimization,Bilevel optimization,Quasiconvex function,Fractional programming,Mathematics | Journal |
Volume | Issue | ISSN |
32 | 2 | Operations Research Letters |
Citations | PageRank | References |
6 | 0.64 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Herminia I. Calvete | 1 | 261 | 21.37 |
| Carmen Galé | 2 | 216 | 15.52 |