Additive Algorithm for Solving 0-1 Integer Linear Fractional Programming Problem

Abstract

In this paper, we present additive algorithm for solving a class of 0-1 integer linear fractional programming problems (0-1 ILFP) where all the coefficients at the numerator of the objective function are of same sign. The process is analogous to the process of solving 0-1 integer linear programming (0-1 ILP) problem but the condition of fathoming the partial feasible solution is different from that of 0-1 ILP. The procedure has been illustrated by two examples.