Solve the following problems using the simplex algorithm and show all of your work (all dictionaries and a list of which variables are basic with their values and which variables are non-basic at each iteration). For each problem, identify if there is a unique optimal solution, if there are multiple optimal solutions (if so find 2), if the problem is degenerate, or if the problem is unbounded C1, 2, 3 20 max 2x2 x3 -2x1 +x2 S3 X1, x2,x30 X2-2X3 5 max

d) 48

step-by-step explanation:

16,32,48,64,80,96,112,128,144,160,176,192,208,224,240,256,272,288,304,320,336

the system of inequalities is

step-by-step explanation:

step 1

find the equation of the dashed line

we have the points

(0,0) and (3,1)

the line passes through the origin, so, is a direct variation

find the slope

the equation of the dashed line is

the solution of the inequality a s the shaded area above the dashed line

therefore

the equation of the inequality a is

step 2

find the equation of the solid line

we have the points

(4,0) and (0,4)

find the slope

the equation of the solid line is

the solution of the inequality b s the shaded area below the solid line

therefore

the equation of the inequality b is

step 3

the system of inequalities is

i’m sorry but i don’t know sorry