Solve the following Integer Programming problem by Branch and Bound Maximization method.

Maximize: $\simplify{{kx} x + {ky} y}$

Subject to

$\simplify{20*{k2} x  + 20*{k1} y} \le  \var{20*s}$

$\simplify{20*{k22} x + 20*{k11}y} \le \var{20*ss}$

$x,y \ge 0$ and integers

Submitting your results:

1. Click on "End Exam" and "Print this results summary" (your problem will be extracted as a pdf file with all the necessary information/data). Do not worry about the "Total 0/0 (0%)" score, this pdf is only for generating a LP problem 0.8356148).
2. Solve the problem by "Branch and Bound Maximization" method by hand, for example, as in the examples included in "Knowledge Reinforcement".
3. This methods requires solving some Continuous optimisation problem at each step. You can use any Computational Packages for finding optimal solution to these continous optimisation problems and do not need to include your code (just use the output-solution); or alternatively, you can solve them by geometric method by hand.