- Asked 3/34
- 2069 Asar · 10 marks
Duality LPP min:Z=3x₁+2x₂
Short answer
The dual is solved by simplex, yielding y₁ = 0, y₂ = 3/4, y₃ = 1/2 and Max W = 19/2. Hence primal minimum Z = 19/2 at x₁ = 1/2, x₂ = 4.
Solve the linear programming problem by the simplex method constructing the duality: Minimize Z = 3x₁ + 2x₂ subject to 2x₁ + 4x₂ ≥ 10, 4x₁ + 2x₂ ≥ 10, x₂ ≥ 4 and x₁, x₂ ≥ 0.
Step 1: Write the dual. For the primal (minimisation, all constraints ≥), the dual is:
Primal: Minimize Z = 3x₁ + 2x₂
subject to 2x₁ + 4x₂ ≥ 10
4x₁ + 2x₂ ≥ 10
x₂ ≥ 4
x₁, x₂ ≥ 0
Dual: Maximize W = 10y₁ + 10y₂ + 4y₃
subject to 2y₁ + 4y₂ ≤ 3
4y₁ + 2y₂ + y₃ ≤ 2
y₁, y₂, y₃ ≥ 0
Here y₁, y₂, y₃ are the dual variables, one for each primal constraint.
Step 2: Standard form of the dual. Add slack variables s₁, s₂ (one per dual constraint). Since all right sides are positive, the slack variables give the starting basis.
Maximize W = 10y₁ + 10y₂ + 4y₃
subject to
2y₁ + 4y₂ + s₁ = 3
4y₁ + 2y₂ + y₃ + s₂ = 2
Step 3: Simplex tables for the dual
Table 1
Cj 10 10 4 0 0
Basis CB y₁ y₂ y₃ s₁ s₂ b Ratio
-----------------------------------
s₁ 0 2 4 0 1 0 3 3/2
s₂ 0 4 2 1 0 1 2 1/2
-----------------------------------
Zj 0 0 0 0 0 0
Cj-Zj 10 10 4 0 0
Entering: y₁ Leaving: s₂ Pivot = 4
Table 2
Cj 10 10 4 0 0
Basis CB y₁ y₂ y₃ s₁ s₂ b Ratio
------------------------------------------
s₁ 0 0 3 -1/2 1 -1/2 2 2/3
y₁ 10 1 1/2 1/4 0 1/4 1/2 1
------------------------------------------
Zj 10 5 5/2 0 5/2 5
Cj-Zj 0 5 3/2 0 -5/2
Entering: y₂ Leaving: s₁ Pivot = 3
Table 3
Cj 10 10 4 0 0
Basis CB y₁ y₂ y₃ s₁ s₂ b Ratio
--------------------------------------------
y₂ 10 0 1 -1/6 1/3 -1/6 2/3 -
y₁ 10 1 0 1/3 -1/6 1/3 1/6 1/2
--------------------------------------------
Zj 10 10 5/3 5/3 5/3 25/3
Cj-Zj 0 0 7/3 -5/3 -5/3
Entering: y₃ Leaving: y₁ Pivot = 1/3
Table 4
Cj 10 10 4 0 0
Basis CB y₁ y₂ y₃ s₁ s₂ b
-----------------------------------
y₂ 10 1/2 1 0 1/4 0 3/4
y₃ 4 3 0 1 -1/2 1 1/2
-----------------------------------
Zj 17 10 4 1/2 4 19/2
Cj-Zj -7 0 0 -1/2 -4
Step 4: Read the answer. All Cj − Zj ≤ 0, so the dual is solved: y₁ = 0, y₂ = 3/4, y₃ = 1/2, Max W = 19/2.
By the duality theorem, Min Z = Max W. The values of the primal variables are the numbers (without sign) in the Cj − Zj row under the slack columns: x₁ = 1/2 (under s₁), x₂ = 4 (under s₂).
Check: Z = 3(1/2) + 2(4) = 19/2.
Answer: x₁ = 1/2, x₂ = 4, Minimum Z = 19/2.
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- Duality LPP min:Z=3x₁+2x₂ · Mathematics III, chapter 5 · asked 3×
- Duality LPP min:Z=8x₁+9x₂ · Mathematics III, chapter 5 · asked 4×
- Duality LPP min:Z=20x+50y · Mathematics III, chapter 5
- Duality LPP min:Z=21x+50y · Mathematics III, chapter 5 · asked 6×
- Duality LPP min:C=16x₁+45x₂ · Mathematics III, chapter 5
- Duality LPP min:Z=8x+9y · Mathematics III, chapter 5 · asked 6×
- Big-M method min:Z=4x₁+2x₂ · Mathematics III, chapter 5
- Graphical method min:z=4x₁+3x₂+x₃ · Mathematics III, chapter 5
- Convergence of 2x+3x²/8+4x³/27+... · Mathematics, chapter 6 · asked 3×