Problem 2 (10 points) For the following linear programming problem, construct its dual.

Minimize Z = -x1 + x2 +2x3

subject to x1 - x2 -3x3 = 1

x1 + x2 0

x1 - x3 <= 5

and x1 is unconstrained in sign, x2 0, and x3 0