Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

REPOSTING A THIRD TIME BECAUSE IT HAS BEEN ANSWERED INCORRECTLY TWICE BY ANONYMO

ID: 3145520 • Letter: R

Question

REPOSTING A THIRD TIME BECAUSE IT HAS BEEN ANSWERED INCORRECTLY TWICE BY ANONYMOUS WITH NO REPLY! I NEED AN INTEGER SOLUTION, NOT THE OPTIMAL SOLUTION. DO NOT JUST GIVE ME AN OPTIMAL SOLUTION WITH FRACTIONS IN IT. USE THE BRANCH AND BOUND ALGORITHM TO BRANCH OUT NONINTEGER SOLUTIONS TO OBTAIN AN INTEGER SOLUTION. FOR EXAMPLE DO NOT JUST DO THE SIMPLEX METHOD AND GIVE ME Z = 29, X1 = 16/3, X2 = 3, X3 = 10/3. BRANCH OUT X1 AND X3 TO TURN THOSE FRACTIONS INTO INTEGERS.

Solve the following Interger Linear Programming problem using the Branch and Bound Algorithm.

Maximize z = 3x1 + x2 + 3x3

Subject to:

x1 + 2x2 + x3 4

4x2 3x3 2

x1 3x2 + 2x3 3

x1, x2, x3 are non-negative integers.

Explanation / Answer

solving integral solution of x1,x2 and x3 we get

x1 = 5 , x2 = 2 and x3 = 3

Z = 23

5 2 2 1 4 2 2 3 3 Z 23