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.
Fannypack
15
Answer
Answers can be viewed only if
- The questioner was satisfied and accepted the answer, or
- The answer was disputed, but the judge evaluated it as 100% correct.
The answer is accepted.
Join Matchmaticians Affiliate Marketing
Program to earn up to 50% commission on every question your affiliated users ask or answer.
- answered
- 736 views
- $10.00
Related Questions
- Differentiate $f(x)=\int_{\tan x}^{0} \frac{\cos t}{1+e^t}dt$
- Internal Rate of Return vs Discount Rate
- College Algebra 1
- Optimization problem
- Get area of rotated polygon knowing all coordinates and angle.
- A word problem about a rectangular carpet
- Calculating Speed and Velocity
- How do you go about solving this question?