TOPIC

BIG–M METHOD
• Minimize Z=2x1+x2

Subject to 3x1 + x2 = 3
4x1 + 3x2 ≥ 6
x1 + 2x2 ≤ 4
x1,x2 ≥ 0
3x1 + x2 A1 3

4x1 + 3x2 x3 A2 6

x1 + 2x2 x4 4

x1 , x2, x3, x4, A1, A2 ≥ 0

• By Introducing Slack variable(x4), Surplus
variable(x3), and Artificial variables(A1,A2)
into the constraints of the given LP problem
becomes as follows:
• Minimize Z = 2x1 + x2 + M( A1 + A2)
= 2X1 + X2 + M( 3-3X1 – X2 +6 -4X1 – 3X2 + X3)
= 2X1 + X2 + M(9 - 7X1 – 4X2 + X3)
= 2X1 + X2 + 9M -7MX1 -4MX2 + MX3
= (2 -7M)X1 + (1-4M)X2 + MX3 + 9M
 TABLE :1 LEAST
POSITIVE
Leading element
BASIS XB X1 X2 X3 X4 A1 A2 RATIO
A1 3 33 1 0 0 1 0 1
A2 6 4 3 -1 0 0 1 3/2
X4 4 1 2 0 1 0 0 4
2-7M 1-4M M 0 0 0

MOST
NEGATIV
 TABLE :2 LEAST
Leading element POSITIVE

BASIS XB X1 X2 X3 X4 A1 A2 RATIO
X1 1 1 1/3 0 0 1/3 0 3
A2 2 0 5/3
5/3 -1 0 -4/3 1 6/5
X4 3 0 5/3 0 1 -1/3 0 9/5
0 1-5M/3 M 0 -2+7M/3 0

MOST
NEGATIV
 6-(4/3*3)=2 4-(1/3*3)=3
4-(1/3*3)=3 1-4M-(2-7M/3*1)=1-
1-4M-(2-7M/3*1)=1-5M/3
5M/3

3-(4/3*1)=5/3 2-(1/3*1)=5/3
M-(2-7M/3*0)=M
M-(2-7M/3*0)=M

-1-(4/3*0)=-1 0-(1/3*0)=0
0-(2-7M/3*0)=0

0-(4/3*0)=0 1-(1/3*0)=1
0-(2-7M/3*1)=-2+7M/3

0-(4/3*1)=-4/3 0-(1/3*1)=-1/3
0-(2-7M/3*0)=0

1-(4/3*0)=1 0-(1/3*0)=0
TABLE :3

BASIS XB X1 X2 X3 X4 A1 A2 RATIO
X1 3/5 1 0 1/5 0 3/5 -1/5 -
X2 6/5 0 1 -3/5 0 -4/5 3/5 -
X4 1 0 0 1 1 1 -1 -
0 0 1/5 0 -2+5M/3 -1+5M/3
 1-(1/5*2)=3/5 3-(1*2)=1
0-(1-5M/3*3/5*0)=0

1-(1/5*0)=1 0-(1*0)=0
M-(1-5M/3*3/5*-1)=1/5
0-(1/5*-1)=4/5
1-(1*-1)=1

0-(1-5M/3*3/5*0)=0
0-(1/5*0)=0 1-(1*0)=1
-2+7M/3-(1-5M/3*3/5*-
4/3)=-2+5M/5
1/3-(1/5*-4/3)=3/5 -1/3-(1*-4/3)=1

0-(1-5M/3*3/5*1)=
0-(1-5M/3*3/5*1)=
0-(1/5*1)=-1/5 0-(1*1)=-1 -1+5M/3
-1+5M/3
 FINAL OPTIMAL SOLUTION
• Minimize Z = 2x1+x2

Here, X1 = 3/5 ~ 0.6

X2 = 6/5 ~ 1.2
So, Our optimal solution becomes,
Z = 2(0.6) + 1.2
= 1.2 + 1.2
Z = 2.4