Mathematics · Linear Programming
Consider the following Primal Linear Programming Problem: Maximize Z = 3x1 + 2x2, subject to the constraints x1 + x2 ≤ 4, x1 - x2 ≤ 2, and x1, x2 ≥ 0. In the final Simplex tableau for this primal problem, the Zj values corresponding to the slack variable columns (s1 and s2) are 52 and 12, respectively. Calculate the optimal values of the dual variables (y1, y2) and the resulting optimal value of the dual objective function W.
- 1y1 = 3, y2 = 1; W = 11
- 2y1 = 4, y2 = 2; W = 12
- 3y1 = 52, y2 = 12; W = 11✓
- 4y1 = 12, y2 = 52; W = 10
Correct answer
y1 = 52, y2 = 12; W = 11
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!
Preparing for Mathematics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
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