# Question: Use the BIP branch and bound algorithm presented in Sec 12 6 to

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

Maximize Z = 2x1 – x2 + 5x3 – 3x4 + 4x5,

Subject to

and

xj is binary, for j = 1, 2, . . . , 5.

Maximize Z = 2x1 – x2 + 5x3 – 3x4 + 4x5,

Subject to

and

xj is binary, for j = 1, 2, . . . , 5.

## Relevant Questions

Post your question