# Question: Follow the instructions of Prob 12 7 2 for the following IP

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 presented in Sec. 12.7 to solve this problem by hand. For each subproblem, solve its LP relaxation graphically.

(c) Use the binary representation for integer variables to reformulate this problem as a BIP problem.

(d) Use the BIP branch-and-bound algorithm presented in Sec. 12.6 to solve the problem as formulated in part (c) interactively.

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 presented in Sec. 12.7 to solve this problem by hand. For each subproblem, solve its LP relaxation graphically.

(c) Use the binary representation for integer variables to reformulate this problem as a BIP problem.

(d) Use the BIP branch-and-bound algorithm presented in Sec. 12.6 to solve the problem as formulated in part (c) interactively.

**View Solution:**## Answer to relevant Questions

Reconsider the IP model of Prob. 12.5-2. (a) Use the MIP branch-and-bound algorithm presented in Sec. 12.7 to solve this problem by hand. For each subproblem, solve its LP relaxation graphically. (b) Now use the interactive ...Use the MIP branch-and-bound algorithm presented in Sec. 12.7 to solve the following MIP problem interactively: Maximize Z = 3x1 + 4x2 + 2x3 + x4 + 2x5, Subject to and xj ≥ 0, for j = 1, 2, 3, 4, 5 xj is binary, for j = 1, ...In Sec. 12.8, at the end of the subsection on tightening constraints, we indicated that the constraint 4x1 – 3x2 + x3 + 2x4 ≤ 5 can be tightened to 2x1 – 3x2 + x3 + 2x4 ≤ 3 and then to 2x1 – 2x2 + x3 + 2x4 ≤ 3. ...Vincent Cardoza is the owner and manager of a machine shop that does custom order work. This Wednesday afternoon, he has received calls from two customers who would like to place rush orders. One is a trailer hitch company ...One powerful feature of constraint programming is that variables can be used as subscripts for the terms in the objective function. For example, consider the following traveling salesman problem. The salesman needs to visit ...Post your question