1. The branching part of the branch and bound algorithm that Solver uses to solve integer programming models means that the algorithm: a. searches through only a limited set of feasible integer solutions b. identifies an incumbent solution which is optimal c. uses a decision tree to find the optimal solution d. creates subsets of solutions through which to search

2. During the solution of a maximization problem with the branch and bound algorithm, an incumbent solution represents an upper bound on the solution. True False

3.If Solver fails to find an optimal solution to an integer programming problem, we might be able to find a near optimal solution by specifying a smaller number for the integer optimality setting. True False

4.An algorithm which uses implicit enumeration: a. does not guarantee that some of the solutions not examined could be optimal b. examines all possible solutions c. is impractical d. excludes many possible solutions that guaranteed to be suboptimal