HW 8 comments

Max: 3.9
Min: 1.8
Average: 3.0
Median: 3.2
 
Comments:
 
B. Few students did not put in previously added bounds along their branching process. The bounds added should always
stay there.
 
D. For complicated problems, it might be clearer (both to you and to the grader) to draw a tree diagram to show how
branching goes. Moreover, it is better to follow strictly what is said in the algorithm: branch whenever the
optimal solution to some L_k is not integral (so that you won't forget some branch), and terminate when all L_k are
solved, or when the bounding condition (see the top of page 62 of the lecture notes) is satisfied.