Big M Method
Rules
+S
-S + A
= +A
Min = +MA in the objective function
Max = -MA in the objective function
Min we should choose the most +ve number in the Z row, if it’s not optimal.
Max we should choose the most -ve number in the Z row, if it’s not optimal.
Example 1
Min Z = X1 + 2X2 + X3 Min Z = X1 + 2X2 + X3
St.
2X1 + 2X2 100 2X1 + 2X2 + S1 = 100
X1 + 2X3 50
X3 = 30
X1,X2,X3 0
PC Entering Variable
Readings
M=100
BV All 1 2 1 0 0 M M RHS Readings
V. X1 X2 X3 S1 S2 A1 A2
Remaining values = old Row – (Corresponding value in the pivot Column) *
(Corresponding in the new row)
S1
2 2 0 1 0 0 0 100
-0(
1/2 0 1 0 -1/2 1/2 0 25
A2
0 0 1 0 0 0 1 30
-1(
1/2 0 1 0 -1/2 1/2 0 25
M-1 -2 3M -1 0 -M 0 0 80M
-3M -1(
1/2 0 1 0 -1/2 1/2 0 25
M-1 – (3M-1) (1/2)
M -1 - 3/2M -1/2
= -1/2 M – 1/2
BV All 1 2 1 0 0 M M RHS Summary
V X1 X2 X3 S1 S2 A1 A2
0 S1 2 2 0 1 0 0 0 100 X1 = 0
X2 = 0
1 0 2 0 -1 1 0 50 X3 = 0
M A1 S1 = 100
M A2 0 0 1 0 0 0 1 30 S2 = 0
Z 0*2 0*2 0*0 0*1 0*0 0*0 0*0 0*100 A1 = 50
+ + + + + + + + A2 = 30
M*1 M*0 M*2 M*0 M*-1 M*1 M*0 M*50 Z= 80M
+ + + + + + + +
M*0 M*0 M*1 M*0 M*0 M*0 M*1 M*30
-1 -2 -1 -0 -0 -M -M -0
=M- =-2 = 3M- =0 =-M 0 0 = 80M
1 1
M=10
Example 2
Max Z = X1 + 2X2 + 4X3 Max Z = X1 + 2X2 + 4X3 + 0S1 - 0S2 -MA1 – MA2
ST
1. X1 + X2 + X3 = 100 X1 + X2 + X3 +A1 = 100
2. X1 + X2 120 X1 + X2 + S1 =120
3. 2X3 20 2X3 – S2 + A2 =20
X1,X2,X3 0 X,S,A 0
Min we should choose the most +ve number in the Z row, if it’s not optimal.
Max we should choose the most -ve number in the Z row, if it’s not optimal.
BV All 1 2 4 0 0 -M -M RHS Readings
V X1 X2 X3 S1 S2 A1 A2
0 S1 1 1 0 1 0 0 0 120 X1=0
X2=0
-M A1 1 1 1 0 0 1 0 100 X3=0
S1=120
-M A2 0 0 2 0 -1 0 1 20 S2=0
A1=100
A2=20
Z -M-1 -M-2 -3M-4 0 M 0 0 -120M Z=-120M
OT=no
M=100
Pivot Column
BV All 1 2 4 0 0 -M -M RHS Readings
V. X1 X2 X3 S1 S2 A1 A2
-M A1 1 1 1 0 0 1 0 100 X1=0
X2=0
0 S1 1 1 0 1 0 0 0 120 X3=0
S1=120
-M A2 0 0 2 0 -1 0 1 20 S2=0
A1=100
A2=20
Z -M*1 -M*1 -M*1 -M*0 -M*0 - -M*0 -M*100 Z=-120M
+ + + + + M*1 + + OT= No
0*1 0*1 0*0 0*1 0*0 + 0*0 0*120
+ + + + + 0*0 + +
-M*0 -M*0 -M*2 -M*0 -M*-1 + -M*1 -M*20
-
M*0
-1 -2 -4 -0 -0 M M -0
-M-1 -M-2 -3M-4 0 M 0 0 -120M
M=100
BV All V 1 2 4 0 0 - - RHS Summary
X1 X2 X3 S1 S2 MA1 MA2
-M A1 1 1 1 0 0 1 0 100
0 S1 1 1 0 1 0 0 0 120
-M A2 0 0 2 0 -1 0 1 20
Z -M*1 -M*1 -M*1
+ + +
0*1 0*1 0*0
+ + +
-M*0 -M*0 -M*2
-1 -2 -4
-M-1 -M-2 -3M-4
Rules
+S
-S + A
= +A
Min = +MA
Max = -MA
Min we should choose the most +ve number in the Z row, if it’s not optimal.
Max we should choose the most -ve number in the Z row, if it’s not optimal.
Min Z = 2X1 + X2 + X3 + 0S1 – 0S2 + MA1 +MA2
ST
X1 + 2X2 100 X1 + 2X2 + S1 =100
X2 +X3 20 X2 +X3 – S2 + A1 = 20
X1 + 2X2 = 40 X1 + 2X2 + A2 = 40
X1,X2,X3 0 X,S,A 0
BV All V 2 1 1 0 0 M M RHS Summary
X1 X2 X3 S1 S2 A1 A2
0 S1 1 2 0 1 0 0 0 100 X1=0
M A1 0 1 1 0 -1 1 0 20 X2=0
M A2 1 2 0 0 0 0 1 40 X3=0
Z M-2 3M -1 M-1 0 -M 0 0 60M S1=100
S2=0
A1=20
A2=40
Z=60M
OT = No
BV All V 2 1 1 0 0 M M RHS Summa
X1 X2 X3 S1 S2 A1 A2 ry
S1 1 0 -2 1 2 -2 0 60
X2 new 0 1 1 0 -1 1 0 20
row
A2 1 0 -2 0 2 -2 1 0
Z M-2 0 -2M 0 2M-1 -3M+1 0 20
M-1
1 2 0 1 0 0 0 100
-2(
0 1 1 0 -1 1 0 20
1 2 0 0 0 0 1 40
-2(
0 1 1 0 -1 1 0 20
M-2 3M -1 M-1 0 -M 0 0 60
M
-3M -1(
0 1 1 0 -1 1 0 20
M-1 – (3M-1) (1)
M-1 – (3M -1)
M-1 -3M + 1
=-2M
-M – (3M-1)(-1)
-M – (-3M+1)
-M +3M -1
=2M-1
0 – (3M-1)(1)
0 – (3M -1)
=-3M+1
60M – (3M-1)(20)
60M – (60M – 20)
60M -60M + 20
=20
