$(15$ points$)$ Use the Branch and Bound method $to$ find the optimal solution $to$ the following

integer programming problem.

minz,$=15x_1+10x_2$

$s.t.15x_1+5x_{2}30$

$,10x_1+10x_{2}30$

$,x_1,x_{2}0,x_1,x_2$ integer

The $LP$ optimum solution for the whole problem $isz=37\mathrm{.}5$ when $(x1,x2)=(1\mathrm{.}5,1\mathrm{.}5).If$ you

become a pathome $at$ each stage, specify what criteria $it$ will $be$ and complete the $B$&$B$ tree.

Using the Simplex method $or$ graph when solving $LPis$ acceptable.

I dont know about this problerm anything.

Please solve and describe $in$ detail.