Simultaneously use the upper bound technique and the dual simplex method manually to solve the following problem.

Minimize Z  3x1  4x2  2x3, subject to x1  x2  x3 15 x2  x3 10 and 0 x1 25, 0 x2 5, 0 x3 15.

C