Use a graphing calculator or a computer program for the simplex method to solve this linear programming problem. X1 X2 X3 X4 51
0 0.375 .625 1
0
.75
.5 .375 0
1 25.125 0 0
- 110 - 90 - 80 - 70 0
S2
0
1
0
0
S3
0490
0 630
1 330
0 0
The optimal solution x4 = , x2 = , x3 = , and x4 = produces the maximum value ..
X 1
(Do not round until the final answer. Then round to the nearest integer as needed.)
X4