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

### Related Questions

- Algebra Word Problem #2
- Sterling's Formula
- How to properly write rational exponents when expressed as roots?
- How does the change in $b$ in the quadratic formula $ax^2+bx+c$ move the parabola in an inverted version of the quadratic function?
- Optimization problem
- Trying to solve this system of simultaneous equations. A solution with work shown would be appreciated.
- Derive and show
- Is the $\mathbb{C}$-algebra $Fun(X,\mathbb{C})$ semi-simple?