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.
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.
- answered
- 198 views
- $10.00
Related Questions
- I really can't figure out equations with a power of 2 in it, please solve these and explain every step as if I was a baby.
- Module isomorphism and length of tensor product.
- Algebra Word Problem 1
- Mechanical principle science (maths)
- Prove that $1+\frac{1}{\sqrt{2}}+\dots+\frac{1}{\sqrt{n}} \leq 2 \sqrt{n}-1$
- Solving for two unknown angles, from two equations.
- Find $n$ such that $\lim _{x \rightarrow \infty} \frac{1}{x} \ln (\frac{e^{x}+e^{2x}+\dots e^{nx}}{n})=9$
- Find $x$ so that $\begin{pmatrix} 1 & 0 & c \\ 0 & a & -b \\ -\frac{1}{a} & x & x^2 \end{pmatrix}$ is invertible