A two-level vertex-searching global algorithm framework for bilevel linear fractional programming problems
We propose a new two-level vertex-searching algorithm framework that finds a global optimal solution to the continuous bilevel linear fractional programming problem over a compact polyhedron, in which both the upper and the lower objectives are linear fractional. Our solution method adopts the verte...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-01-01
|
| Series: | Systems Science & Control Engineering |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1080/21642583.2020.1805815 |