operations research

For the IP given below: min = 61 + 82 : 31 + 2 4 1 + 22 4 1, 2 0 and integer The final simplex table of the LP relaxed model is as follows;

Find the optimum integer result with the cutting plane algorithm.

\begin{tabular}{|c|c|c|c|c|c|c|c|} \hline z & x1 & x2 & e1 & e2 & a1 & a2 & RHS \\ \hline 1 & 0 & 0 & -0.8 & -3.6 & -99 & -96 & 17.6 \\ \hline 0 & 1 & 0 & -0.4 & 0.2 & 0.4 & -0.2 & 0.8 \\ \hline 0 & 0 & 1 & 0.2 & -0.6 & -0.2 & 0.6 & 1.6 \\ \hline \end{tabular}