# 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.

## Answer to relevant Questions

A real estate development firm, Peterson and Johnson, is considering five possible development projects. The following table shows the estimated long-run profit (net present value) that each project would generate, as well ...Consider the assignment problem with the following cost table: (a) Design a branch-and-bound algorithm for solving such assignment problems by specifying how the branching, bounding, and fathoming steps would be performed. ...Follow the instructions of Prob. 12.7-2 for the following IP model: Minimize Z = 2x1 + 3x2, Subject to And x1 ≥ 0, x2 ≥ 0 x1, x2 are integer. (a) Solve this problem graphically. (b) Use the MIP branch-and-bound algorithm ...For each of the following constraints of pure BIP problems, use the constraint to fix as many variables as possible: (a) 4x1 + x2 + 3x3 + 2x4 ≤ 2 (b) 4x1 – x2 + 3x3 + 2x4 ≤ 2 (c) 4x1 – x2 + 3x3 + 2x4 ≥ 7 One of the constraints of a certain pure BIP problem is x1 + 3x2 + 2x3 + 4x4 ≤ 5. Identify all the minimal covers for this constraint, and then give the corresponding cutting planes.Post your question