Mathematics · Linear Programming
For the primal linear programming problem Minimize ZP = cX, subject to AX ≥ b, and X ≥ 0, its dual problem Maximize ZD is formulated as:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1ZD = bTw, ATw ≤ cT, w ≥ 0✓
- 2ZD < bTw, ATw ≥ cT, w ≤ 0
- 3ZD = bTw, ATw ≤ cT, w ≥ 0
- 4ZD = wbT, ATw ≥ cT, w ≥ 0
Correct answer
ZD = bTw, ATw ≤ cT, w ≥ 0
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Mathematics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Linear Programming MCQs →Want more practice questions on Linear Programming?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Linear Programming