Consider the following linear programming problem

Maximize	$1 X1 + $3 X2
Subject To	X1 + X2 4	Constraint A
	X1 - X2 1	Constraint B
	X1, X2 0	Constraint C

Note: Report two digits after the decimal point. Do NOT use thousands-separators (,)

1 - Which of the following is the correct standard maximization form for the above linear programming problem

Answer CorrectNot Correct	Answer CorrectNot Correct	Answer CorrectNot Correct	Answer CorrectNot Correct
Z - X1 - 3 X2 - 0 S1 - 0 S2 = 0 X1 + X2 + S1 + 0 S2 = 4 X1 - X2 + 0 S1 + S2 = 1 X1, X2, S1, S2 0	Z -X1 - 3X2 = 0 X1 + X2 4 X1 - X2 1 X1, X2 0	Z - X1 - 3 X2 = 0 X1 + X2 + S1 = 4 X1 - X2 + S2 = 1 X1, X2, S1, S2 0	Z - X1 - 3X2 - S1 - S2 = 0 X1 + X2 = 4 X1 - X2 = 1 X1, X2, S1, S2 0

2- Fill out the following blanks with Final Simplex Tableau information

Basic Variables	X1	X2	S1	S2	Z	Right Hand Side
AnswerX1X2S1S2	Answer	Answer	Answer	Answer	Answer	Answer
AnswerX1X2S1S2	Answer	Answer	Answer	Answer	Answer	Answer
P	Answer	Answer	Answer	Answer	Answer	Answer

3- The optimal is

Z = Answer

When

X1 = Answer

X2 = Answer