Use the BIP branch-and-bound algorithm presented in Sec. 12.6 to solve the following problem interactively.

Minimize Z 5x1 6x2 7x3 8x4 9x5, subject to 3x1  x2 x3 x4  2x5  2 x1 3x2  x3  2x4 x5  0

x1  x2 3x3 x4 x5  1 and xj is binary, for j 1, 2, . . . , 5.