# Solve this problem using branch and bound algorithm.

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 only be viewed under the following conditions:**

- The questioner was satisfied with and accepted the answer, or
- The answer was evaluated as being 100% correct by the judge.

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.

- answered
- 1050 views
- $10.00

### Related Questions

- Confused on this graph question, not sure how to reduce it to linear and It looks too wonky to draw a best fit line, probably won't take long
- Need to figure distance between two points/lines.
- When is Galois extension over intersection of subfields finite
- Algebra Word Problem #1
- If both $n$ and $\sqrt{n^2+204n}$ are positive integers, find the maximum value of $𝑛$.
- College Algebra 1
- Reverse this equation/function (2d to isometric)
- Population Equations