Bi-level linear fractional programming problem

This paper considers the problem in which two decision makers wish to maximize their own objective functions, which are linear fractional functions, over a feasible region defined by interactive strategy sets. Such programs are non-convex. An algorithm based on the concept of kth best solution is developed. The algorithm is based on the concept that the optimal solution lies at a vertex. An example to illustrate is also presented.