Question: The initial tableau of a linear programming problem is given. Use the simplex method to solve the problem. x1 x2 x3 s1 s2 s3 z
The initial tableau of a linear programming problem is given. Use the simplex method to solve the problem.
| x1 | x2 | x3 | s1 | s2 | s3 | z | |||
| 2 | 2 | 9 | 1 | 0 | 0 | 0 | 32 | ||
| 4 | 5 | 8 | 0 | 1 | 0 | 0 | 56 | ||
| 2 | 2 | 8 | 0 | 0 | 1 | 0 | 24 | ||
| 14 | 10 | 12 | 0 | 0 | 0 | 1 | 0 |
Question content area bottom
Part 1
The maximum is
enter your response here
when
x1=enter your response here,
x2=enter your response here,
x3=enter your response here,
s1=enter your response here,
s2=enter your response here,
and
s3=enter your response here.
(Type integers or simplified fractions.)
| Use the simplex method to solve the linear programming problem. | Maximize | z=10x1+15x2 | |
| subject to: | 12x1+3x2 | 33 | |
| 5x1+x2 | 50 | ||
| 3x1+3x2 | 48 | ||
| with | x10, x20 | ||
Question content area bottom
Part 1
Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice.
A.The maximum is
enter your response here
when
x1=enter your response here,
x2=enter your response here,
s1=enter your response here,
s2=enter your response here,
and
s3=enter your response here.
(Type integers or simplified fractions.)
B.
There is no maximum.

Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
