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

Authors

  • Md Rajib Arefin Department of Mathematics, Dhaka University, Dhaka-1000
  • Touhid Hossain Department of Mathematics, Dhaka University, Dhaka-1000
  • Md Ainul Islam Department of Mathematics, Dhaka University, Dhaka-1000

Keywords:

0-1 Integer programming, Dual feasibility, Implicit enumeration

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.

DOI: http://dx.doi.org/10.3329/dujs.v61i2.17066

Dhaka Univ. J. Sci. 61(2): 173-178, 2013 (July)

Abstract
389
PDF
1179

Downloads

Published

2013-11-19

How to Cite

Additive Algorithm for Solving 0-1 Integer Linear Fractional Programming Problem. (2013). Dhaka University Journal of Science, 61(2), 173-178. https://doi.org/10.3329/dujs.v61i2.17066

Issue

Vol. 61 No. 2 (2013)

Section

Articles

How to Cite

Additive Algorithm for Solving 0-1 Integer Linear Fractional Programming Problem. (2013). Dhaka University Journal of Science, 61(2), 173-178. https://doi.org/10.3329/dujs.v61i2.17066