Simplex

Write the following problem in tableau form. Which variables would be in the initial basis?

Max x1 + 2x2

s.t. 3x1 + 4x2  100

2x1 + 3.5x2  60
2x1 - 1x2 = 4

x1 , x2  0

Sol.
Max x1 + 2x2 + 0s1 + 0s2- Ma1 - Ma2

s.t. 3x1 + 4x2 + s1 = 100

2x1 + 3.5x2 - s2 + a1 = 60
2x1 - 1x2 + a2 = 50

x1 , x2 , s1 , s2 , a1 , a2  0
 The initial basis would include s1, a1, and a2 .

Solve the following problem by the simplex method.

Max 14x1 + 14.5x2 + 18x3

s.t. x1 + 2x2 + 2.5x3  50
x1 + x2 + 1.5x3  30
x 1 , x2 , x3  0

sol.

Problem in tableau form

Max 14x1 + 14.5x2 + 18x3 + 0 S1 + 0 S2

s.t. x1 + 2 x2 + 2.5x3 +S1 = 50
x1 + x2 + 1.5x3 +S2 = 30
x1 , x2 , x3, S1, S2  0

x1 x2 x3 s1 s2
Basis cB 14 14.5 18 0 0
s1 0 1 2 2.5 1 0 50
s2 0 1 1 1.5 0 1 30
zj 0 0 0 0 0 0
cj - zj 14 14.5 18 0 0

Row* =pivot row/ pivot point

1/ 2.5 = 0.4
2/ 2.5 = 0.8
2.5/ 2.5 = 1
1/ 2.5 =0.4
0/ 2.5 = 0
50/ 2.5 = 20
New S2 =current s2 - ( aij opposite to the pivot point * Row* )
1 - (1.5 * 0.4 )= 0.4
1- (1.5* 0.8) = -0.2
 1.5 - (1.5* 1) = 0
0- (1.5* 0.4 ) = -0.6
1- (1.5*0)= 1
30- (1.5*20)= 0

1 x1 x2 x3 s1 s2
Basis cB 14 14.5 18 0 0
x3 18 .4 .8 1 .4 0 20
s2 0 .4 -.2 0 -.6 1 0
zj 7.20 14.4 18 7.2 0 360
cj - zj 6.8 .1 0 -7.2 0

x1 x2 x3 s1 s2
Basis cB 14 14.5 18 0 0
x3 18 0 1 1 1 -1 20
x1 14 1 -.5 0 -1.5 2.5 0
zj 14 11 18 -3 17 360
cj - zj 0 3.5 0 -3 -17

x1 x2 x3 s1 s2
Basis cB 14 14.5 18 0 0
x2 14.5 0 1 1 1 -1 20
x1 14 1 0 .5 -1 2 10
zj 14 14.5 21.5 .5 13.5 430
cj - zj 0 0 -3.5 -.5 -13.5

X1= 10 X2=20 X3=0 S1 =0 S2=0 Z=430

Solve the following problem by the simplex method.

Max 100x1 + 120x2 + 85x3

s.t. 3x1 + 1x2 + 6x3  120

 5x1 + 8x2 + 2x3  160

x1 , x2 , x3  0

Basis cB 100 120 85 0 0

s1 0 3 1 6 1 0 120
s2 0 5 8 2 0 1 160
zj 0 0 0 0 0 0
c j - zj 100 120 85 0 0

x1 x2 x3 s1 s2
Basis cB 100 120 85 0 0
s1 0 2.375 0 5.75 1 -.125 100
x2 120 .625 1 .25 0 .125 20
zj 75 120 30 0 15 2400
c j - zj 25 0 55 0 -15

x1 x2 x3 s1 s2
Basis cB 100 120 85 0 0

x3 85 .413 0 1 .174 -.0217 17.391

x2 120 .522 1 0 -.043 .1304 15.652

zj 97.745 120 85 9.63 13.8035 3356.52

cj - zj 2.283 0 0 -9.565 -13.8035
 x1 x2 x3 s1 s2
Basis cB 100 120 85 0 0
x3 85 0 -.792 1 .2083 -.125 5
x1 100 1 1.917 0 -.0833 .250 30
zj 100 124.38 85 9.3755 14.375 3425
cj - zj 0 -4.375 0 -9.375 -14.375

Comment on the solution shown in this simplex tableau.

x1 x2 x3 s1 s2
Basis cB 3 5 9 0 0
x3 9 1/3 2/3 1 1/3 0 40
s2 0 5/3 19/3 0 -1/3 1 100
zj 3 6 9 3 0 360
c j - zj 0 -1 0 -3 0

The tableau indicates alternate optimal solution

A linear program has alternate optimal solutions if the final tableau has a cj - zj
value equal to 0 for a non basic variable
 Comment on the solution shown in this simplex tableau.

x1 x2 x3 s1 s2 a1
Basis cB 1 2 5 0 0 -M
a1 -M -3 -1 0 -1 -2 1 4
x3 5 1 1/2 1 0 1/2 0 4
-
zj 5+3M 2.5+M 5 M 2.5+2M -M
4M+20
c j - zj -4-3M -.5-M 0 -M -2.5-2M 0

The tableau indicates an infeasible solution.

Infeasibility is detected in the simplex method when an artificial variable
remains positive in the final tableau.

Comment on the solution shown in this simplex tableau.

x1 x2 x3 s1 s2
Basi
cB 4 6 5 0 0
s
s1 0 3 0 -1 1 -1 26
x2 6 1 1 1 0 -1 10
zj 6 6 6 0 -6 60
cj - zj -2 0 -1 0 6

The tableau indicates an unbounded solution

A linear program has an unbounded solution if all entries in an entering column
are non-positive.