Integer Programming (Branch and Bound Method)

In this video lecture we are going to see problem on integer programming 1) the method we are going to study is branch and bound algorithm where the optimum solution obtained by graphical method or simplex method is a rounded off to its nearest integer and 2) the new constraint is used to solve the problem again to find the new feasible solution in this way branch and bound method is solved many times for many feasible solution 3)In the maximum value of feasible solution is selected if the problem is of maximization type branch and bound algorithm is generally used where the variables are less than or equal to 2 number if variables are more than two then Gomory cutting plane algorithms are used.