operational research: Solve the problem of integer linear programming next with the branch-and-bound method. When more than one variable is fractional, choose the variable of smaller index. Solve graphically each sub-problems. 

Min z =-2x1-5x2 s.a 2x 8x2 s 31 xI, x220 et entiers and integer5