Max Z = 3 x1 + 2 x2

sub to
x1 3 x2

x1 2 x2

2 x1 +

x2 20

x1 + 3 x2 30
- x1 +

x2

0 x 1 8 , 0 x2 6

Converting to Equality

Max Z = 3 x1 + 2 x2 + 0 S1 + 0 S2 + 0 S3 + 0 S4 + 0 S5
sub to
x1 3 x2 + S1 =

x1 2 x2 + S2 =

2 x1 +

x2 + S3 = 20

x1 + 3 x2 + S4 = 30
- x1 +

x2 + S 5 =

x1 , x2 , S1 , S2 , S3 , S4 , S5 0

Corner I

Cj

uj
Cj
Basi
c

8
3

6
2

x1

x2

S1

S2

0
S3

S4

S5

bi

uj - bi

S1

-3

S2

-2

S3

20

S4

30

S5
Zj
Cj - Zj

-1
0
3

1
0
2

0
0
0

0
0
0

0
0
0

0
0
0

1
0
0

Z=0

1 = Min { bi / yi1 , yi1 > 0} = Min { 3 / 1 , 4 / 1 , 20 / 2 , 30 / 1 } = 3

2 = Min { uj - bi / - yi1 , yi1 0} = Min { / -(-1) } =
3 = u1 = 8
= Min { 1 , 2, 3 } = Min { 3, , 8 } = 3
ie. For 1 , and S1 is the leaving Variable
Hence Normal Pivot Operation.

Corner II

Cj

uj
Cj
Basi
c

8
3

6
2

x1

x2

S1

S2

0
S3

S4

S5

u-b

x1

-3

S2

-1

S3

-2

14

S4

-1

27

S5
Zj
Cj - Zj

0
3
0

-2
-9
11

1
3
-3

0
0
0

0
0
0

0
0
0

1
0
0

1 = Min { bi / yi2 , yi2 > 0} = Min { 1 / 1 , 14 / 7 , 27 / 6 } = 1

2 = Min { uj - bi / - yi2 , yi1 0} = Min { 5 / -(-3) , / -(-2) } = 5/3
3 = u2 = 6
= Min { 1 , 2, 3 } = Min { 1, 5/3 , 6 } = 1

Z=9

ie. For 1 , and S2 is the leaving Variable

Hence Normal Pivot Operation.

Corner III

Cj

uj
Cj
Basi
c

8
3

6
2

x1

x2

S1

S2

0
S3

S4

S5

u-b

x1

-2

x2

-1

S3

-7

S4

-6

21

S5
Zj
Cj - Zj

0
3
0

0
2
0

-1
-8
8

2
11
-11

0
0
0

0
0
0

1
0
0

11

Z = 20

1 = Min { bi / yi3 , yi3 > 0} = Min { 7 / 5 , 21 / 5 } = 7/5

2 = Min{ uj - bi / - yi3 , yi3 0} = Min {2 / -(-2) , 5 / -(-1) , / -(-1)} = 1

 3 = u3 =
= Min { 1 , 2, 3 } = Min { 7/5, 1 , } = 1
ie. For 2 , and x1 is the leaving Variable
Hence Normal Pivot Operation.

Corner IV

Cj

uj
Cj
Basi
c

8
3

6
2

x1

x2

S1

S2

0
S3

S4

S5

u-b

S1

-1/2

-3/2

-3

x2

-1/2

-1/2

-2

S3

5/2

1/2

22

S4

5/2

3/2

36

S5
Zj
Cj - Zj

-1/2
-1
4

0
2
0

0
0
0

1/2
-1
1

0
0
0

0
0
0

1
0
0

Z=-4

This solution is not feasible. X 1 is eligible to enter and the upper bound
of the variable is 8. Hence substitute

x1 = u1 x1' = 8 - x1'

where

0 x1' 8

Corner V

Cj

uj
Cj
Basi
c

8
-3

6
2

x1'

x2

S1

S2

0
S3

S4

S5

u-b

S1

1/2

-3/2

x2

1/2

-1/2

S3

-5/2

1/2

S4

-5/2

3/2

16

S5
Zj
Cj - Zj

1/2
1
-4

0
2
0

0
0
0

1/2
-1
1

0
0
0

0
0
0

1
0
0

12

Z = 4 + 24
= 28

1 = Min { bi / yi4 , yi4 > 0} = Min { 2 / (1/2) , 16 / (3/2), 12 / (1/2) } = 4

2 = Min{ uj - bi / - yi4 , yi4 0} = Min { / -(-3/2) , 4 / -(-1/2) } = 8
3 = u4 =
= Min { 1 , 2, 3 } = Min { 4, 8 , } = 4
ie. For 1 , and S3 is the leaving Variable
Hence Normal Pivot Operation.

Corner VI

Cj

uj
Cj
Basi
c

8
-3

6
2

x1'

x2

S1

S2

0
S3

S4

S5

u-b

S1

-7

x2

-2

S2

-5

S4

-3

12

S5
Zj
Cj - Zj

3
-4
1

0
2
0

0
0
0

0
0
0

-1
2
-2

0
0
0

1
0
0

10

Z = 8 + 24
= 32

1 = Min { bi / yi1 , yi1 > 0} = Min { 12 / 5 , 10 / 3 } = 12/5

2 = Min {uj - bi / - yi1 , yi1 0} = Min { / -(-7) , 2 / -(-2) , / -(-5)} = 1
3 = u1 = 8
= Min { 1 , 2, 3 } = Min { 12/5, 1 , 8 } = 1
ie. For 2 , and x2 is the leaving Variable
Hence Normal Pivot Operation.

Corner VII

Cj

uj
Cj
Basi
c

8
-3

6
2

x1'

x2

S1

S2

0
S3

S4

S5

u-b

S1

-7/2

-1/2

-7

-3

x1'

-1/2

-1/2

-2

-1

S2

-5/2

-1/2

-6

S4

5/2

-1/2

22

S5
Zj
Cj - Zj

0
-3
0

3/2
3/2
1/2

0
0
0

0
0
0

1/2
3/2
-3/2

0
0
0

1
0
0

16

Z = 6 + 24
= 30

This solution is not feasible. X 2 is eligible to enter and the upper bound
of the variable is 6. Hence substitute

x2 = u2 x2' = 6 x2'

0 x2' 6

where

Corner VIII

Cj

uj
Cj
Basi
c

8
-3

6
-2

x1'

x2'

S1

S2

0
S3

S4

S5

S1

7/2

-1/2

14

-3

x1'

1/2

-1/2

S2

5/2

-1/2

S4

-5/2

-1/2

S5
Zj
Cj - Zj

0
-3
0

-3/2
-3/2
-1/2

0
0
0

0
0
0

1/2
3/2
-3/2

0
0
0

1
0
0

7
Z = -3 + 36
= 33

All Cj - Zj Values are non positive (either Zero or Negative). Hence

the optimal Solution is obtained.
x1' = -1,

x1 = u1 x1' = 8 - 1 = 7

x2' = 0,

x2 = u2 x2' = 6 0 = 6

ie.

Z = 3 x1 + 2 x2 = 3 * 7 + 2 * 6 = 33