Question

Use Branch and Bound technique to solve the following problem Maximise z = 3x1 + 3x2 + 13 x3 Subject to – 3x1 + 6x2 + 7x3 ≤ 8 6x1 – 3x2 + 7x3 ≤ 8 0 ≤ xj ≤ 5 And xj are integer j = 1, 2, 3. (Operation Research)

Answer 1

Unfortunately, your question requires a lot of work and cannot be done for free.
Submit it with all requirements as an assignment to our control panel and we'll assist you.