Use the bip branch-and-bound algorithm presented in sec. 12.6 to solve the following problem interactively: maximize z = 2x1-x2 + 5x3-3x4 + 4x5, subject to 3x1-2x2 + 7x3-5x4 + 4x5 s 6 x2 + 2x3-4x4 + 2xs0 and x is binary, for j-1, 2, . . , 5.

option 1 is correct.

step-by-step explanation:

y varies inversely with x and constant of variation is 4

the equation will be:

y = k/x

where k =4 so,

y = 4/x

if we put values of x of option 1 in the above equation and find values of y

y = 4/-2 => y =-2

y = 4/-1 => y = -4

y = 4/1 => y = 4

y = 4/2 => y =2

so, all the values of x and y are correct.

if we put values of x given in other options and find value of y we cannot find whole table satisfying the equation.

hence option 1 is correct.

one that is bigger than 3 1/2

-2

7 - 9 = -2

reversed:

-2 + 9 = 7