Consider the following linear programming model:

Maximize

3x1 + 2x2 +3x3

Subject to

x1 + x2 + 3x3 1 x1 + 4x2 + 2x3 2 2x1 + 3x2 + 4x3 2 x1, x2, x3 0

Questions :

1) Transform the above model into a standard linear program and find the initial solution.

2) Solve the model using the simplex method to find the optimal solution.