fractional linear programming problem

In mathematical programming different types of cuts have been developed in the past to get an integer value of the decision variables. In this paper, we have developed a new integer cut for getting an integer solution of the fractional linear programming problem (FLPP). This technique allows the decision-maker to solve the formulated FLPP to be conveniently using the Branch and Bound approach in order to achieve the optimum final solution. The process of development of the integer cut is shown with sufficient detail and a numerical illustration is used for clarification purpose.