A Multi-Level Programming Problem (MLPP) is a hierarchical optimization problem where the constraint region of the first level is implicitly determined by the other optimization problems. In this paper, an integer multi-level programming problem is considered. At each level, there are multiple objective functions which are linear fractional and the feasible region is assumed to be a convex polyhedron. Here, the variables are bounded. An algorithm is developed for ranking and scanning the set of feasible solutions. These ranked solutions are used to find the efficient solution of Multi- Level Linear Fractional Programming Problem (MLLFPP). An example is illustrated and solved using LINGO 17.A multi-level integer linear fractional programming problem with bounded variables is considered. The multiple objective functions at each level are linear fractional. To find the set of efficient solutions for this multi-level programming problem, a mathematical model is evolved. This model scans the feasible region to find the efficient integral points. A solution procedure has been developed describing the above model. A numerical example is illustrated which is also solved by the software LINGO 17.