Consider the following integer programming problem.Maximize: z=8x1 +12x2 +6x3 +4x4
Subject to constraint: 5x1 + 9x2 +4x3 +3x4 ≤ 16 where x1, x2, x3 and x4 are binary integers (0 or 1).
By applying the Branch and Bound Algorithm find the solution.
The Equation will be satisfied as below
Sustitute above values in Z
** Please rate the answer if you liked it by clicking on thumbs-Up. Thank-you
Get Answers For Free
Most questions answered within 1 hours.