# 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
- 865 views
- $10.00

### Related Questions

- College Algebra 1
- How old is the wise man?
- Show that the $5\times 5$ matrix is not invertable
- Find the domain of the function $f(x)=\frac{\ln (1-\sqrt{x})}{x^2-1}$
- Does $\lim_{n \rightarrow \infty} \frac{2^{n^2}}{n!}$ exist?
- How to properly write rational exponents when expressed as roots?
- Algebra Word Problem #2
- Prove that $A - B=A\cap B^c$