Use the simplex method to solve the linear programming problem.

Maximize	z=7x1+6x2+x3
subject to	3x1+	9x2+	x3	12
	x1+	5x2+	3x3	19
	x10, x20, x30.

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,

x3=enter your response here,

s1=enter your response here,

and

s2=enter your response here.

B.

There is no maximum.

For the given maximization problem, (a) determine the number of slack variables needed, (b) name them, and (c) use slack variables to convert each constraint into a linear equation.

Question content area bottom left

Part 1

a. How many slack variables are needed?

enter your response here

...

Question content area right

Part 1

Maximize	z=9x1+3x2+x3
subject to:	7x1+5x2+10x3		123
	4x1+7x2+15x3		227
with x10, x20, x30