Question

Consider the following integer programming problem.Maximize: z=8x₁ +12x₂ +6x₃ +4x₄

Subject to constraint: 5x₁ + 9x₂ +4x₃ +3x₄ ≤ 16 where x1, x2, x3 and x4 are binary integers (0 or 1).

By applying the Branch and Bound Algorithm find the solution.

Answer 1

Solution:

Assume, ,,,

The Equation will be satisfied as below

To maximise  

Sustitute above values in Z

i.e.

** Please rate the answer if you liked it by clicking on thumbs-Up. Thank-you