Question

E. In the optimal solution to the LP relaxation of the original problem, both variables have an integer value; therefore, we do not branch. Question C.4. True or false? In the optimal solution to one of the two created subproblems, both variables have an integer value; therefore, we obtain an incumbent (candidate integer feasible) solution. Question C.5. True or false? In the two subproblems created after node 0 (nodes 1 and 2), the lower bounds obtained are 10 and 11.67. Question C.6. True or false? The first incumbent (integer feasible) solution found is x1 = 0, x2 = 3. Question C.7. True or false? Excluding node 0, we create 6 nodes (subproblems) until we find the optimal solution to the integer program. Question C.8. True or false? The optimal solution is x1 = 1, x2 = 2.

          E. In the optimal solution to the LP relaxation of the original problem, both variables have an integer value; therefore, we do not branch.

Question C.4. True or false?
In the optimal solution to one of the two created subproblems, both variables have an integer value; therefore, we obtain an incumbent (candidate integer feasible) solution.

Question C.5. True or false?
In the two subproblems created after node 0 (nodes 1 and 2), the lower bounds obtained are 10 and 11.67.

Question C.6. True or false?
The first incumbent (integer feasible) solution found is x1 = 0, x2 = 3.

Question C.7. True or false?
Excluding node 0, we create 6 nodes (subproblems) until we find the optimal solution to the integer program.

Question C.8. True or false?
The optimal solution is x1 = 1, x2 = 2.

E. In the optimal solution to the LP relaxation of the original problem, both variables have an integer value; therefore, we do not branch.

Question C.4. True or false?
In the optimal solution to one of the two created subproblems, both variables have an integer value; therefore, we obtain an incumbent (candidate integer feasible) solution.

Question C.5. True or false?
In the two subproblems created after node 0 (nodes 1 and 2), the lower bounds obtained are 10 and 11.67.

Question C.6. True or false?
The first incumbent (integer feasible) solution found is x1 = 0, x2 = 3.

Question C.7. True or false?
Excluding node 0, we create 6 nodes (subproblems) until we find the optimal solution to the integer program.

Question C.8. True or false?
The optimal solution is x1 = 1, x2 = 2.

Added by Michael T.

Question

Please give Ace some feedback