The final simplex tableau for a maximization problem is:
|
Basis CB
|
x1
|
x2
|
s1
|
s2
|
s3
|
s4
|
b
|
|
10
|
9
|
0
|
0
|
0
|
0
|
|
x2 9
|
0
|
1
|
30/16
|
0
|
-21/16
|
0
|
252
|
|
s2 0
|
0
|
0
|
-15/16
|
1
|
5/32
|
0
|
120
|
|
x1 10
|
1
|
0
|
-20/16
|
0
|
30/16
|
0
|
540
|
|
s4 0
|
0
|
0
|
-11/32
|
0
|
9/64
|
1
|
18
|
|
zj
|
10
|
9
|
70/16
|
0
|
111/16
|
0
|
7,668
|
|
cj- zj
|
0
|
0
|
-70/16
|
0
|
-111/16
|
0
|
a. Calculate the range of optimality for the profit contribution of x1, that is, the c1 coefficient.
b. Calculate the range of optimality for the profit contribution of x2, that is, the c2 coefficient.
c. Calculate the range of feasibility for b1.
d. Calculate the range of feasibility for b2.