Q.The dual of the linear programming problem: Minimize CT x subject to Ax ≥ b and x ≥ 0 is
Correct answer: Maximize bT w subject to AT w ≤ c and
Read, practise, and share this question using its permanent link.