This is the initial tableau of a linear programming problem. Solve by the simplex method.
                  

x 1
x1
x 2
x2
s 1
s1
s 2
s2
s 3
s3
z



1
3
3
1
0
0
0
12

2
4
4
0
1
0
0
2
2
1
1
1
0
0
1
0
4
minus
−2
minus
−1
0
0
0
1
0





Question content area bottom
Part 1
The maximum is
  
enter your response here
  when
x 1
x1
equals
=
  
enter your response here
​,
x 2
x2
equals
=
  
enter your response here
​,

s 1
s1
equals
=
11
11​,
s 2
s2
equals
=​0, and
s 3
s3
equals
=
3
3.