LINEAR PROGRAMMING

SIMPLEX METHOD
Managerial Problem:
Flair Furniture Company
 The Flair Furniture Company produces inexpensive tables and chairs

 Processes are similar in that both require a certain amount of hours of

carpentry work and in the painting and varnishing department

 Each table takes 4 hours of carpentry and 2 hours of painting and

varnishing
 Each chair requires 3 hours of carpentry and 1 hour of painting and

varnishing
 There are 240 hours of carpentry time available and 100 hours of painting

and varnishing
 Each table yields a profit of $70 and each chair a profit of $50

 Give decision, how many tables and chairs to be produced to get the

optimum benefit.
Formulation of Managerial Problem
 Max. Profit : 70 x + 50 y
Subject to the constraints
2x + y 100
4x + 3y 240
x, y 0
Solution :
Step 1 : Converting Constraints into equations
2x + y +s1 = 100

4x + 3y +s2 = 240 ….(i)

Max. Z = 70 x + 50 y + 0s1+ 0 s2
Above equations must have equal number of variables.
2x + y + 1s1 + 0 s2 = 100

4x + 3y + 0s1 + 1 s2 = 240 …. (2)

The equation (2) can be written in Matrix form as AX = B
  =

Developing initial simlex tableau

CB Cj 70 50 0 0 Ratio
Column
basis x y s1 s1 bi

0 s1 2 1 1 0 100 100/2 =2
0 s2 4 3 0 1 240 240/4 =60
Zj 0 0 0 0 0
Cj- Zj 70 50 0 0
Developing initial simlex tableau
CB Cj 70 50 0 0 Ratio
Column
basis x y s1 s1 bi

0 s1 2 1 1 0 100 100/2 =2
0 s2 4 3 0 1 240 240/4 =60
Zj 0 0 0 0 0
Cj- Zj 70 50 0 0
 Performing Optimality Test ( Zj =

  Column x
For  For Column y   Column s1
For
Zj = 0 + 0 Zj = 01 + 0 Zj = 0 + 0
=0 =0 =0

  Column s2
For   Column bi
For
Zj = 0 + 0 Zj = 0100 + 0240
=0 =0
 Since all Cj – Zj are neither 0 nor negative, feasible solution is not optimal
We run for next revised simplex tableau, until all Cj – Zj are negative and
zero .
In Cj – Zj row, 70 is the largest positive number. The variable in the
corresponding column is called entering variable. The column is called Key
column or Pivot column.
To choose the leaving variable, we need to find the ratio column. It is
calculated by dividing the element of column bi by corresponding
elements of key column.
In ration column 50 is smallest non-negative number. The row
corresponding to smallest number is called Pivot row or key row. The
intersection of Pivot row and Pivot column is known as Pivot number. The
variable in the corresponding row is called leaving variable.
is entering variable
s1 is leaving variable.
Developing Second simlex tableau
Main row : 2/2 = 1, 1/2 = 0.5, 1/2 = 0.5, 0/2 = 0, 100/2 = 50.

CB Cj 70 50 0 0 Ratio
Column
basis x y s1 s1 bi

x
s2
Zj
Cj- Zj
 Performing Optimality Test ( Zj =

 For Column x  For Column y   Column s1

For
Zj = 0 + 0 Zj = 01 + 0 Zj = 0 + 0
=0 =0 =0

  Column s2
For  For Column bi
Zj = 0 + 0 Zj = 0100 + 0240
=0 =0
Developing Second simlex tableau
Main row : 2/2 = 1, 1/2 = 0.5, 1/2 = 0.5, 0/2 = 0, 100/2 = 50.

CB Cj 70 50 0 0 Ratio Column
basis x y s1 s1 bi
x 1 0.5 0.5 0 50 50/0.5 =100
s2 0 1 -2 1 40 40/1 = 40
Zj 70 35 35 0 3500
Cj- Zj 0 5 -35 0
 Developing Second simlex tableau
Main row : 2/2 = 1, 1/2 = 0.5, 1/2 = 0.5, 0/2 = 0, 100/2 = 50.

CB Cj 70 50 0 0 Ratio Column
basis x y s1 s1 bi
x 1 0.5 0.5 0 50 50/0.5 =100
s2 0 1 -2 1 40 40/1 = 40
Zj 70 35 35 0 3500
Cj- Zj 0 5 -35 0

No. in old row Number above or Corresponding no. in Numbers in New

below Pivot new pivot row row
number
4 - 4 1 = 0
3 - 4 1/2 = 1
0 - 4 1/2 = -2
1 - 4 0 = 1
240 - 4 50 = 40
Developing Second simlex tableau
Main row : 2/2 = 1, 1/2 = 0.5, 1/2 = 0.5, 0/2 = 0, 100/2 = 50.

CB Cj 70 50 0 0 Ratio Column
basis x y s1 s1 bi
x 1 0.5 0.5 0 50 50/0.5 =100
s2 0 1 -2 1 40 40/1 = 40
Zj 70 35 35 0 3500
Cj- Zj 0 5 -35 0

 Performing Optimality Test ( Zj =

 For Column x  For Column y   Column s1

For
Zj = 70 + 0 Zj = 701/2 + 0 Zj = 70/2 + 0= 35
= 70 = 35

  Column s2
For  For Column bi
Zj = 70 + 0 Zj = 700 + 040
=0 = 3500
Since all Cj – Zj are neither 0 nor negative, feasible solution is not optimal
We run for next revised simplex tableau, until all Cj – Zj are negative and
zero .
In Cj – Zj row, 15 is the largest positive number. The variable in the
corresponding column is called entering variable. The column is called Key
column or Pivot column.
Developing Third simlex tableau
Main row : 0/1 = 0, 1/1 = 1, -2/1 = -2, 1/1 = 1, 40/1= 40.

CB Cj 70 50 0 0 Ratio Column
basis x y s1 s1 bi
x 1 0 3/2 -0.5 30 50/0.5 =100
y 0 1 -2 1 40 40/1 = 40
Zj 70 50 5 15 4100
Cj- Zj 0 0 -5 -15
 CB Cj 70 50 0 0 Ratio Column
basis x y s1 s1 bi
x 1 0 3/2 -0.5 30 50/0.5 =100
y 0 1 -2 1 40 40/1 = 40
Zj 70 50 5 15 4100
Cj- Zj 0 0 -5 -15

No. in old row Number above or Corresponding no. in Numbers in New

below Pivot new pivot row row
number
1 - 1/2 0 = 0
1 - 1/2 0 = 0
1/2 - 1/2 1 = 1
1/2 - 1/2 1 = 1
1/2 - 1/2 -2 = -2
1/2
0 -- 1/2
1/2 -2
1 == -2
1
0
50 - 1/2 1
40 = 1
40
50 - 1/2 40 = 40
CB Cj 70 50 0 0 Ratio Column
basis x y s1 s1 bi
x 1 0 3/2 -0.5 30 50/0.5 =100
y 0 1 -2 1 40 40/1 = 40
Zj 70 50 5 15 4100
Cj- Zj 0 0 -5 -15

 Performing Optimality Test ( Zj =

 For Column x  For Column y   Column s1

For
Zj = 70 + 50 Zj = 70 + 50 Zj = 70/2 + 50= 5
= 70 = 50

  Column s2
For  For Column bi
Zj = 70+ 50= 15 Zj = 700 + 5040 =
4100
 Since all Cj – Zj are either 0 or negative, further improvement is
not possible, so feasible solution is optimal.
Here, x = 30, y = 40, z = 4100
Z = 70x + 50y
= 70 30 + 50 40
= 4100