Post optimal or Sensitivity Analysis

1. Changes affecting feasibility

Feasibility of simplex solution is affected in one of the
two ways.

an increase or decrease in the resource (change in

right hand side)

A new constraint is added in the model

8/2/12

1
1

Change in resource
Let total glazing time by the company is reduced from 1499 to
400 hours. Find the maximum revenue.

Basic Tableau
x1 x2
Optimum
Z

s1

x1

s1

s2

s3

s4

20/
3
1 -2/3

32/3 1266
0
-5/3 84

-2/3 333

1/3

s1
1 -2/3 0 -5/3
s3
0
0
0 -1/3
x1
0 1/3 0 -2/3
8/2/12
0 -1/3
1 -1/3
x1s3becomes
negative
x2
0
1
0 and
0z

1500
2450/3
1 -1/3 17
400 =
-100/3
1150/3
=600
16000/3
0
1 250

2
2

Dual Simplex
Basic

x1 x2 s1

s1

x1
Basic

20/
3
1 -2/3

s3
0
0

s4

32/3 16000
/3
-5/3 2450 /
3

1
0
0 1/3
x1 x2 s1 s2

s3
0
0
z
16 0
s1 -5/2 0
x2
0
1
Ratio z/x1
s4

s2

-3/2 0

0
0
1
0

0 -2/3 -100 /
s3 s4
b
3
-1/3 1 -1/3 1150 /
12 0
0
4800
3
-3/2 0
0
900
0
0
1
250
16 Min.

0 -1/2
8/2/12

50

Optim
um
Tablea
u
3
3

If the available hours for polishing is 800, then

8/2/12

4
4

From above tableau,

x1 = 333- 1/3 s2 + 2/3 s4 &

x2 = 250- s4

Put the values of x1 and x2 in new constraint; i.e. x1 + 2x2 + s5 =

800
we will get
-1/3 s2 -4/3 s4 + s5
= -33
8/2/12

5
5

Using
simplex

dual

8/2/12

6
6

8/2/12

7
7

Post optimal or Sensitivity Analysis

2. Changes affecting Optimality
Optimality of simplex solution is affected in one of the
two ways.

A change in objective function

A decision variable is added

8/2/12

8
8

Change in objective function

Suppose plain tiles is sold for Rs. 40 instead of Rs. 20. The
objective function will become:
Z = 40x1 + 24x2
y1 , y2 , y3 , y4 =

1 -2/3 0
0 , 40 , 0 , 24 0 1/3 0
0 -1/3 1
Basic x1 x20 s10 s20

Y1

s1

20/
3
1 -2/3
8/2/12

-5/3
-2/3 = 0,40/3,0,-8/3
-1/3
s3
s4
b
1
0
0

32/3 1266
0
-5/3 84

9
9

Find Optimum Tableau

Basic

x1 x2 s1

s1

x1
Basic

s2

40/
3
1 -2/3

1
0
0 1/3
x1 x2 s1 s2

s3
z

0
0

x2
s1

0
0

s3

s4

-8/3 12660

-5/3

0 -2/3
s3 s4

84

333
b

0
0 -1/3 1 -1/3 17
8/3 0 40/ 0
0 39980/
3
3
1
0
0
0
1
250
5/3 1 -2/3 0
0 1502/3
8/2/12

Non optimal solution

10
10

8/2/12

11
11

Adding a new activity

8/2/12

12
12

1
x3 constraint column= 0
0
0

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

0
0
1
0

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

Basic x1 x2 x3 s1 s2 s3
Z

s1

1
0

s3
s1

0
0

0 20/ 0 32/3 1266

10/3
3
0
1/3

1 -2/3 0 -5/3 84

Basic x1 x2 x3 s1 s2 s3
x1
Z

s4

1 1/3
1 =
1/3
2
5/3
00

s4

0 1/3
0
0

0 1/3 0 -2/3 333

0 6 2 46/9 1269
4
0 5/3 0 -1/3 1 -1/3 17
0
0
1 -3/5 -1/5 - 403/
8/2/12
10/9 5

13
13