SIMPLEX MAXIMIZATION
Problems:
Supply the simplex
maximization tables.
Cj
150 160 0
0 0
Prod Qty x1 x2 s1
s2 s3
|
0 S1 100 1 0 0 0
1
0
S2 200 0 1 0 1
0
0 S3 300 0 0 1 0
0
|
Zj
Cj-Zj
|
2.
Cj
200 160 0
0 0
Prod Qty x1 x2 s1
s2 s3
|
0 S1 100 1 0 0 0
1
160 X2 200 0 1 0 1
0
0 S3 100 0 0 1
-1 0
|
Zj
Cj-Zj
|
3.
Cj 8
10 0 0
0
Prod Qty x y s1
s2 s3
|
8 x 1 1
0 -1/7 3/7
-1/7
10 y 1 0 1
3/7 2/7
5/21
|
Zj
Cj-Zj
|