The dual of a linear programming problem (LPP) can be formulated from the given primal. For a given primal problem, we can construct the dual by considering the constraints and the objective function of the primal problem.
- The primal objective function coefficients become the right-hand side (RHS) values of the dual constraints.
- The dual variables correspond to the primal constraints.
In this case, the primal is a minimization problem with constraints involving $w_1$, $w_2$, $w_3$, and $w_4$. The dual formulation maximizes the expression \(z = 3x_1 - 2x_2\), making (D) the correct answer.