Lesson eLearning

Given the primal LP: minimise subject to . Find the dual problem, solve the dual using the simplex method, and determine the optimal value of the primal.

hard 4 marks Class 12 · Mathematics · Linear Programming
Answer
Dual optimum value ₹21.333, primal optimum value ₹21.333 achieved at

The correct answer is Dual optimum value ₹21.333, primal optimum value ₹21.333 achieved at — Initial tableau: |BV | | | | | RHS | |----|-----|-----|-----|-----|-----| | | 1 | 3 | 1 | 0 | 3 | | | 2 | 1 | 0 | 1 | 5 | | | -8 | -7 | 0 | 0 | 0 |

Step-by-step solution

  1. Write primal in standard form with inequalities of "+ and "-": - Constraint 1: with (since )\n- Constraint 2: with \nObjective: minimise
  2. Formulate dual: For each primal variable create dual variable ; Primal has 2 variables → dual has 2 constraints; Primal has 2 constraints → dual has 2 variables ( from first constraint, from second).\nDual form: Maximise subject to:
  3. Set up dual simplex tableau (since constraints are ) using standard form: Add slack :
  4. Initial tableau: |BV | | | | | RHS | |----|-----|-----|-----|-----|-----| | | 1 | 3 | 1 | 0 | 3 | | | 2 | 1 | 0 | 1 | 5 | | | -8 | -7 | 0 | 0 | 0 |
Common mistake: Confusing sign of dual constraints when primal has constraints

Concept tested: Duality and solving dual LP

Published · How this solution was prepared and checked

Related questions

← All Linear Programming questions