A global optimization algorithm for solving the bi-level linear fractional programming problem

In this paper, we obtain the solution to bi-level linear fractional programming problem (BLFP) by means of an optimization algorithm based on the duality gap of the lower level problem. In our algorithm, the bi-level linear fractional programming problem is transformed into an equivalent single level programming problem by forcing the dual gap of the lower level problem to zero. Then, by obtaining all vertices of a polyhedron, the single level programming problem can be converted into a series of linear fractional programming problems. Finally, the performance of the proposed algorithm is tested on a set of examples taken from the literature.

► We consider the solution to bilevel linear fractional programming problems.
► BLFP is transformed into single level programming problem using the dual gap.
► The examples are solved to illustrate the feasibility of our algorithm.