For each of the following linear programming models, give your recommendation on which is the more e

For each of the following linear programming models, give
your recommendation on which is the more efficient way
(probably)
to obtain an optimal solution: by applying the simplex method
directly to this primal problem or by applying the simplex
method
directly to the dual problem instead. Explain.
(a) Maximize Z = 10x1 - 4x2 + 7x3,
subject to
3x1 - x2 + 2x3 ≤ 25
x1 - 2x2 + 3x3 ≤ 25
5x1 + x2 + 2x3 ≤ 40
x1 + x2 + x3 ≤ 90
2x1 - x2 + x3 ≤ 20
and
x1 ≥ 0, x2 ≥ 0, x3 ≥ 0.