Download Now Free registration required
Integer Linear Programming Problem (ILPP) is a special case of Linear Programming Problem (LPP) 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 the authors have taken a new and simple hybrid (primal-dual) algorithm which finds the optimal solution for a class of integer linear programming problems. Normally for solving ILPP Gomory method or Branch and Bound technique is used. This new algorithm does not use the simplex method unlike Gomory cutting plane method and Branch and Bound techniques.
- Format: PDF
- Size: 208.1 KB