Linear
programming (Lp) is a branch of applied mathematics. Generally, linear programming problem (Lpp) solving is done by
simplex method. A kind of linear
programming, named Integer Linear Programming (ILpp) is being necessited to integer solution. There exist different methods for solving integer linear programming problem (ILpp) for example: Gomory’s-all – integer Algorithm, Dantzig – cut method, Branch and bound method, etc. These methods have time, space and
computational complexities. It is intended to try to solve ILpp with GA in this paper. This method has loss time, space and computational complexities.