Question

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.


$1.99
Sales0
Views40
Comments0
  • CreatedSeptember 22, 2015
  • Files Included
Post your question
5000