The branch and bound method of solving linear integer programming problems is
A) an integer method.
B) a relaxation method.
C) a graphical solution.
D) an enumeration method.

Question

Quizplus · Accepted Answer

The branch and bound method is an enumeration method that involves partitioning the feasible region into smaller regions and solving the linear programming problem in each sub-region. This method is especially useful for solving mixed integer linear programming problems where some variables are restricted to be integers. Therefore, choice D is the best answer.

The Branch and Bound Method of Solving Linear Integer Programming