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 be viewed only if
  1. The questioner was satisfied and accepted the answer, or
  2. The answer was disputed, but the judge evaluated it as 100% correct.
View the answer
The answer is accepted.
Join Matchmaticians Affiliate Marketing Program to earn up to 50% commission on every question your affiliated users ask or answer.