Question

The following tableau represents a specific simplex iteration for a maximization problem.

           Z   x₁   x₂   x₃   s₁   s₂   s₃ RHS

           1   0    a     0   3    5    0   15  

           0   0    0    1   1    0    b   3

           0   1    d     0   1    2    0   5

           0   0   -3    0   -2    6    1     c

For each part 1)-3) specify any numerical value for each of a, b, c, and d that would:

   1) allow x₂ to enter the basis to improve the value of z.

     a = ____,   b = ____,   c = ____, d = ____.   

   2) indicate that the problem is unbounded.

     a = ____,   b = ____,   c = ____, d = ____.   

   3) indicate alternate optimal solutions.   

     a = ____,   b = ____,   c = ____, d = ____.  

You may insert the values in the spaces provided.

Answer 1

banic 5- iable that and-t hant L,