When formulating linear programming problem, variables should have been regarded as taking integer
values. Problems in which this is the case are called integer program. In this paper a new algorithm to solve integer
linear programming problems is given. This algorithm consists of two steps. In step 1 the intercepts of a promising
variable based on the different constraints are found out. Using the intercept matrix obtained for all the promising
variables, a maximum of m variables are selected and arranged where m is the number of constraints. Also the
maximum value that each of the arranged variable can assume is found out. In step 2, the arranged variables are
allowed to enter into the basis with an integer value which is less than the maximum value it can assume. Step 1 and
2 are repeated till no variable could enter with integer value. In the proposed integer linear programming algorithm
the improved solution moves in the interior of the feasible region.
Keywords
Arrangement of variables
feasible solution
algorithm
Authors
G.Karthikeyan
Prof S.Sakthivel
How to Cite this Article
G.Karthikeyan, Prof S.Sakthivel (2015).
"NEW EFFICIENT ALGORITHM TO SOLVE PURE INTEGER PROGRAMMING PROBLEM".
International Journal of Contemporary Research in Computer Science and Technology,
1(5), pp. 136-141.
