By using given equation the maximum is 8 when
= 2 and
= 0;
= 2,
= 0, and
= 0. The correct option is A.
A linear programming problem that can be solved using the simplex method. The problem is as follows:
Maximize:

Subject to:




Convert the problem into a standard form by introducing slack variables.
Find the initial tableau.
Choose the pivot column and pivot row.
Perform the pivot operation.
Repeat steps 3 and 4 until all constraints are satisfied or the objective function is maximized.
In this case, the initial tableau is as follows:
RHS
z -2 -1 0 0 0 0
1 5 1 0 0 12
2 2 0 1 0 4
1 3 0 0 1 4
After performing a few pivot operations, we get the final tableau:
RHS
z 0 0 1 2 1 8
1 0 0 1/2 1/2 2
0 2 0 1/2 -1 0
0 1 0 -1/2 1/2 0
From the final tableau, we can see that the maximum value of z is 8 when
= 2 and
= 0.
The slack variables
, and
are all 0.
Therefore, the correct answer is A.