Consider the Following Integer Programming Problem $\mathrm { Z } = 2 x _ { 1 } + x _ { 2 }$

Short Answer

Consider the following integer programming problem. Solve it using the branch and bound method. What are the optimal values of x1, x2 and Z?
Maximize $\mathrm { Z } = 2 x _ { 1 } + x _ { 2 }$
Subject to: $\quad 2 x _ { 1 } + 2 x _ { 2 } \leq 7$
$~~~~~~~~~~~~~~~~~~~4 x _ { 1 } + x _ { 2 } \leq 11$
$~~~~~~~~~~~~~~~~~~~x _ { 1 }$ and $x _ { 2 } \geq 0$