Consider the following maximization problem: max 0ₓ₁ +0ₓ₂ +0ₓ₃ subject to a₁₁ₓ₁ +a₁₂ₓ₂+a₁₃ₓ₃ ≤ b₁
a₂₁ₓ₁ +a₂₂ₓ₂ +a₂₃ₓ₃ ≤ b₂ ₓ₁, ₓ₂, ₓ₃ ≥ 0
(a) Write the dual of the above problem (Use y₁ and y₂ for dual variables). And find a feasible solution of the dual problem by inspection. (b) If the above primal problem is infeasible, then is there a feasible dual solution 31, 32 such that biyi + b2y2 <0 or not? Why?