You are on page 1of 7

BIG-M METHOD

Minimize Z= 4x1 + 3x2
2x1 + x2 ≥ 10
-3x1 + 2x2 ≤ 6
x1 + x2 ≥ 6
Convert to standard form
2x1 + x2 – S1 = 10
-3x1 + 2x2 + S2 = 6
x1 + x2 – S3 = 6
Put x1, x2 , equal to zero
We get
S1 = -10
S2 =6
S3 = -6

It violates the condition of feasibility therefore we add artificial variable in constrain 1 and 3 and add a large penalty in objective function Minimize Z= 4x1 + 3x2 + MA1 + MA2 2x1 + x2 – S1 + A1 = 10 -3x1 + 2x2 + S2 = 6 x1 + x2 – S3 + A2 = 6 Put x1. S1 equal to zero We get A1 = 10 S2 =6 A2 = 6 . x2 .

Basic x1 x2 S1 S2 S3 A1 A2 SOL Z Z -Z 4 3 0 0 0 M M 0 A1 2 1 -1 0 0 1 0 10 S2 -3 2 0 1 0 0 0 6 A2 1 1 0 0 -1 0 1 6 New Z-row = Old z-row-(M*R2+ M*R4 ) Basic x1 x2 S1 S2 S3 A1 A2 SOL RATIO Z Z -Z 4-3M 3-2M M 0 M 0 0 -16M A1 2 1 -1 0 0 1 0 10 5 S2 -3 2 0 1 0 0 0 6 A2 1 1 0 0 -1 0 1 6 6 .

Row operations R2 = R2/2 R4 = R4 – New R2 R3 = R3 + (3*New R2) -Z Row = -Z Row – ((4-3M)*New R2) Basic x1 x2 S1 S2 S3 A2 SOL RATIO Z -Z 0 1-M/2 2-M/2 0 M 0 -M-20 x1 1 1/2 -1/2 0 0 0 5 10 S2 0 7/2 -3/2 1 0 0 21 6 A2 0 1/2 1/2 0 -1 1 1 2 .

x2 = 2 .(1/2*New R2) -Z Row = -Z Row – ((1-1/2M)*New R4) Basic x1 x2 S1 S2 S3 SOL RATIO -Z 0 0 1 0 2 -22 x1 1 0 -1 0 1 4 S2 0 0 -5 1 0 21 x2 0 1 1 0 -2 2 So optimum solution is x1 =4 .Row operations R4 = R4 *2 R3 = R3 –( New R2 * 7/2) R2 = R2 . Z=22 .

• Minimize Z=x1 – 2x2 – 3x3 -2x1 + x2 + 3x3 = 2 2x1 + 3x2 + 4x3 =1 • Minimize Z = 600x1 + 500 x2 2x1 + x2 ≥ 80 x1 + 2x2 ≥ 60 .

• No solution • X1 =100/3 x2 = 40/3 .