In: Statistics and Probability
1) Consider you work in a Convenience Store and you have 5¢, 10¢, 20¢, 25¢, and 50¢ pieces in the cash register. You must give a customer 90¢ in change. Formulate an IP that can be used to minimize the number of coins needed to give the correct change and solve the problem using the branch-and-bound method. Use Excel Solver to solve the subproblems at each node of the branch-and-bound tree.
2) Solve the following IP using branch-and-bound.For each subproblem, solve the LP-relaxation using the graphical method (show the feasible region, label new boundaries, the optimal solution, the iso-profit line through the optimal solution). Summarize your results in a branch-and-bound tree
Maximum Z= 6x1 +10x2
S.t:
x1 + 2x2<=14.5
2x1<=16
x2<=6
x1,x2=>0; Integer
If someone can explain their process along with answers that would be amazing.