Additive Algorithm for Solving 0-1 Integer Linear Fractional Programming Problem
DOI:
https://doi.org/10.3329/dujs.v61i2.17066Keywords:
0-1 Integer programming, Dual feasibility, Implicit enumerationAbstract
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.
DOI: http://dx.doi.org/10.3329/dujs.v61i2.17066
Dhaka Univ. J. Sci. 61(2): 173-178, 2013 (July)
Downloads
193
924