The dual of the linear programming problem: Minimize cᵀx subject to Ax ≥ b and x ≥ 0रैखिक प्रोग्रामिंग समस्या:
The dual of the linear programming problem:
Minimize cᵀx subject to Ax ≥ b and x ≥ 0
is
रैखिक प्रोग्रामिंग समस्या:
Minimize cᵀx subject to Ax ≥ b और x ≥ 0
का द्वैत है
Show answerHide answer
Correct answer: (B) maximize bᵀw subject to Aᵀw ≤ c and w ≥ 0maximize bᵀw subject to Aᵀw ≤ c और w ≥ 0
Explanation
For a minimization problem with Ax ≥ b and x ≥ 0 (the canonical form), the dual is: maximize bᵀw subject to Aᵀw ≤ c, w ≥ 0.न्यूनतमीकरण समस्या Ax ≥ b, x ≥ 0 (मानक रूप) का द्वैत है: bᵀw अधिकतम करें, प्रतिबंध Aᵀw ≤ c, w ≥ 0।