Simplex Method - Part 2
Uploaded by
kkarpagamSimplex Method - Part 2
Uploaded by
kkarpagamFinding Optimal Solution using Simplex Method
(Part 2)
K Karpagam
Assistant Professor of Mathematics
PG & Research Department of Mathematics
Sri Ramakrishna College of Arts & Science, Coimbatore
1.Use Simplex Method
Maximum Z = 3x1 + 4x2
Subject to condition
4x1 + 2x2 ≤ 80
2x1 + 5x2 ≤ 180 and x1 , x2 ≥ 0
Solution :
Maximum Z = 3x1 + 4x2 + 0s1 + 0s2
Subject to condition
4x1 + 2x2 + s1 + 0s2 = 80
2x1 + 5x2 + 0s1 + s2 = 180 and x1 , x2 , s1 , s2 ≥ 0 .
IBFS : s1 = 80 ; s2 = 180 and x1 = 0 ; x2 = 0
Cj 3 4 0 0
CB YB XB x1 x2 s1 s2
0 s1 80 4 2 1 0
0 s2 180 2 5 0 1
Zj 0 0 0 0 0
Zj – Cj 0 -3 -4 0 0
ϴ = min xB = min 80 , 180
ai
2 5
= min {40 , 36} = > ϴ = 36
New , x2 = 180/5 , 2/5 , 5/5 , 0/5 , 1/5
x2 = 36 , 0.4 , 1 , 0 , 0.2
Solving
Old s1 = > 80 4 2 1 0
x2 × 2 = > 72 0.8 2 0 0.4
(-) (-) (-) (-) (-)
8 3.2 0 1 -0.4
1 Iteration :
st
Cj 3 4 0 0
CB YB XB x1 x2 s1 s2
0 s1 8 3.2 0 1 -0.4
4 x2 36 0.4 1 0 0.2
Zj 144 1.6 4 0 0.8
Zj – Cj 144 -1.4 0 0 0.8
ϴ = min xB = min 8 , 36
ai 3.2 0.4
New , x1 = 8/3.2 , 3.2/3.2 , 0 , 1/3.2 , -0.4/3.2
x1 = 2.5 , 1 , 0 , 0.31 , -0.12
Solving
Old x2 = > 36 0.4 1 0 0.2
x2 × 0.4 = > 1 0.4 0 0.1 -0.048
(-) (-) (-) (-) (-)
35 0 1 -0.1 0.248
2nd Iteration :
Cj 3 4 0 0
CB YB XB x1 x2 s1 s2
3 x1 2.5 1 0 0.31 -0.12
4 x2 35 0 1 - 0.1 0.25
Zj 147.5 3 4 0.53 0.64
Zj – Cj 147.5 0 0 0.53 0.64
Maximum Z = 148 (or) `147.5 and x1 = 2.5 ; x2 = 35
Verification :
Z = 3x1 + 4x2
= 3(2.5) + 4(35)
Z = 147.5 .
2. Solve by simplex
Maximum Z = 3x1 + 2x2 + 5x3
Subject to condition
x1 + 4x2 ≤ 420
3x1 + 2x2 ≤ 460
x1 + 2x2 + x3 ≤ 430 and x1 , x2 , x3 ≥ 0
Solution :
Maximum Z = 3x1 + 2x2 + 5x3 + 0s1 + 0s2 + 0s3
Subject to condition
x1 + 4x2 + 0x3 + s1 + 0s2 + 0s3 = 420
3x1 + 2x2 + 0x3 + 0s1 + s2 + 0s3 = 460
x1 + 2x2 + x3 + 0s1 + 0s2 + s3 = 430
x1 , x2 , x3 , s1 , s2 , s3 ≥ 0
Cj 3 2 5 0 0 0
CB YB XB x1 x2 x3 s1 s2 s3
0 s1 420 1 4 0 1 0 0
0 s2 460 3 2 0 0 1 0
0 s3 430 1 2 1 0 0 1
Zj 0 0 0 0 0 0 0
Zj – Cj = 0 -3 -2 -5 0 0 0
ϴ = min xB= 420 , 460 , 430= > ϴ = 430
ai
0 0 1
1st Iteration :
Cj 3 2 5 0 0 0
CB YB XB x1 x2 x3 s1 s2 s3
0 s1 420 1 4 0 1 0 0
0 s2 460 3 2 0 0 1 0
5 x3 430 1 2 1 0 0 1
Zj 2150 5 10 5 0 0 5
Zj – Cj = 2150 2 8 0 0 0 5
Maximization Z = 2150 and x1 = 0 ; x2 = 0 ; x3 = 430
Verification :
Max Z = 3x1 + 2x2 + 5x3
= 3(0) + 2(0) + 5(430)
Max Z = 2150
