Solve this problem using branch and bound algorithm.

Consider the following integer program
maximize z = 5x1 + 4x2
subject to x1 + x2 ≤ 5
             10x1 + 6x2 ≤ 45
              x1, x2 ≥ 0 integer
The optimal solution to the linear programming relaxation is x1 = 3.75, x2 = 1.25, and z = 23.75. Solve this problem using the branch-and-bound algorithm. Start by branching on x1.


Answers can only be viewed under the following conditions:
  1. The questioner was satisfied with and accepted the answer, or
  2. The answer was evaluated as being 100% correct by the judge.
View the answer
The answer is accepted.
Join Matchmaticians Affiliate Marketing Program to earn up to a 50% commission on every question that your affiliated users ask or answer.