7 6 9.2.1 Branch-and-Bound (B&B) Algorithm: Example 9.2-1: Maximize z = 5 x1 + 4 x2 + Select an area to comment on subject to x1 + x2 =0, and integer Optimum (continuous): *1 - 3.75, X2 = 1.25 Figure 9.2 Solution space for ILP (dot points) and LP1 (shaded area) of Example 9.2-1 (LP1) SY 5 4 3 LP1 Z23.75 2 1 0 6 Hw1 Repeat the example Part1: Choose x2 as branching variable: a- solution for starting Ip2 before Ip3 b- solution for starting Ip3 before Ip2 Part2: Research for B&B: How to select a branching variable (a variable to branch on) in order to reduce the time to find the optimal solution. 7 6 9.2.1 Branch-and-Bound (B&B) Algorithm: Example 9.2-1: Maximize z = 5 x1 + 4 x2 + Select an area to comment on subject to x1 + x2 =0, and integer Optimum (continuous): *1 - 3.75, X2 = 1.25 Figure 9.2 Solution space for ILP (dot points) and LP1 (shaded area) of Example 9.2-1 (LP1) SY 5 4 3 LP1 Z23.75 2 1 0 6 Hw1 Repeat the example Part1: Choose x2 as branching variable: a- solution for starting Ip2 before Ip3 b- solution for starting Ip3 before Ip2 Part2: Research for B&B: How to select a branching variable (a variable to branch on) in order to reduce the time to find the optimal solution