Skip to Main Content
A special case of Linear Programming Problem (LPP) is Integer Linear Programming Problem (ILPP) in which a few or all the decision variables are required to be non-negative integers. For solving ILPP, normally Gomory cutting plane or Branch and Bound technique is used. In this paper, for implementation of the problem in neural network we have taken a new and simple hybrid (primal-dual) algorithm which finds the optimal solution for a class of integer linear programming problem. Normally for solving ILPP Gomory method or Branch and Bound technique is used. This new algorithm taken for implementation does not use the simplex method unlike Gomory cutting plane method and Branch and Bound techniques. The algorithm was considered for implementation with Artificial Neural Network (ANN) and the result shows a great improvement in prediction of results. Literature shows that ILPP occurs most frequently in transportation problems, assignment problems, traveling salesman problems, sequencing problems, routing decisions etc. Thus the implementation of backpropogation neural network on the new algorithm provided comprehensive results when applied with any of the above said problems.
Date of Conference: 29-31 July 2010