Scribd
Upload
62 views

M1 - S4 - Linear Programming - Simplex Method

The document summarizes solving a linear programming problem (LPP) using the simplex method. It involves maximizing an objective function subject to constraints. The steps include: 1) Adding slack variables, 2) Constructing a simplex table, 3) Identifying the pivot column using minimum ratio test, 4) Pivoting to make the pivot element zero. After going through the iterations, the optimal solution is found to be X1=8, X2=2, with maximum Z = 64.

Uploaded by

jbalaji47
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
62 views

M1 - S4 - Linear Programming - Simplex Method

The document summarizes solving a linear programming problem (LPP) using the simplex method. It involves maximizing an objective function subject to constraints. The steps include: 1) Adding slack variables, 2) Constructing a simplex table, 3) Identifying the pivot column using minimum ratio test, 4) Pivoting to make the pivot element zero. After going through the iterations, the optimal solution is found to be X1=8, X2=2, with maximum Z = 64.

Uploaded by

jbalaji47
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 20

LPP – Simplex Method

Dr. J. Balaji
Solve the following LPP using Simplex method

Max Z = 6X1 + 8X2

subject to

5X1 + 10X2 <= 60


4X1 + 4X2 <= 40

X1 and X2 >= 0
Max Z = 6X1 + 8X2

Step 1 : Add the Slack variable to the respective


constraints
5X1 + 10X2 + S1 = 60
4X1 + 4X2 + S2 = 40
X1 X2 S1 S2 Solution
5 10 1 0 60
4 4 0 1 40
Step 2: Construct the table as shown below

CB Cj
(Coefficient of Solution Ratio
Basic Variable) Basic X1 X2 S1 S2
Variable

S1
S2
Zj
Cj-Zj
Step 2: Construct the table as shown below

CB Cj 6 8 0 0
(Coefficient of Solution Ratio
Basic Variable) Basic X1 X2 S1 S2
Variable

S1
S2
Zj
Cj-Zj
CB Cj 6 8 0 0
(Coefficient of Solution Ratio
Basic Variable) Basic X1 X2 S1 S2
Variable

0 S1
0 S2
Zj
Cj-Zj
CB Cj 6 8 0 0
(Coefficient of Solution Ratio
Basic Variable) Basic X1 X2 S1 S2
Variable

0 S1 5 10 1 0 60
0 S2 4 4 0 1 40
Zj
Cj-Zj
CB Cj 6 8 0 0
(Coefficient of Solution Ratio
Basic Variable) Basic X1 X2 S1 S2
Variable

0 S1 5 10 1 0 60
0 S2 4 4 0 1 40
Zj 0 0 0 0 0
Cj-Zj

Zj = ∑(CB * Xij) = (0 * 5 + 0 * 4) = 0
CB Cj 6 8 0 0
(Coefficient of Solution Ratio
Basic Variable) Basic X1 X2 S1 S2
Variable

0 S1 5 10 1 0 60
0 S2 4 4 0 1 40
Zj 0 0 0 0 0
Cj -Zj 6 8 0 0
CB Cj 6 8 0 0
(Coefficient of Solution Ratio
Basic Variable) Basic X1 X2 S1 S2
Variable

0 S1 5 10 1 0 60
0 S2 4 4 0 1 40
Zj 0 0 0 0 0
Cj-Zj 6 8 0 0

Max (Cj-Zj) = (6,8,0,0)


Pivot Column

CB Cj 6 8 0 0
(Coefficient of Solution Ratio
Basic Variable) Basic X1 X2 S1 S2
Variable

0 S1 5 10 1 0 60
0 S2 4 4 0 1 40
Zj 0 0 0 0 0
Cj-Zj 6 8 0 0
CB Cj 6 8 0 0
(Coefficient of Solution Ratio
Basic Variable) Basic X1 X2 S1 S2
Variable

0 S1 5 10 1 0 60
0 S2 4 4 0 1 40
Zj 0 0 0 0 0
Cj-Zj 6 8 0 0
CB Cj 6 8 0 0
(Coefficient of Solution Ratio
Basic Variable) Basic X1 X2 S1 S2
Variable

0 S1 5 10 1 0 60 60/10 = 6
0 S2 4 4 0 1 40 40/4 = 10
Zj 0 0 0 0 0
Cj-Zj 6 8 0 0
Min (Ratio) = (6,10)

CB Cj 6 8 0 0
Solution Ratio
Basic X1 X2 S1 S2
Variable
0 S1 5 10 1 0 60 60 / 10 = 6
0 S2 4 4 0 1 40 40 / 4 = 10
Zj 0 0 0 0 0
Cj-Zj 6 8 0 0
Min (Ratio) = (6,10)

CB Cj 6 8 0 0
Solution Ratio
Basic X1 X2 S1 S2
Variable
0 X2 60 / 10 = 6
0 S2 4 4 0 1 40 40 / 4 = 10
Zj
Cj-Zj
Min (Ratio) = (6,10)

CB Cj 6 8 0 0
Solution Ratio
Basic X1 X2 S1 S2
Variable
0 X2 (5/10 =1/2) 10/10=1 1/10 0 6 60 / 10 = 6
0 S2 4 4 0 1 40 40 / 4 = 10
Zj
Cj-Zj
CB Cj 6 8 0 0
Solution Ratio
Basic X1 X2 S1 S2
Variable
0 X2 1/2 1 1/10 0 6
0 S2 4 4 0 1 40
Zj
Cj-Zj
CB Cj 6 8 0 0
Solution Ratio
Basic X1 X2 S1 S2
Variable
0 X2 1/2 1 1/10 0 6
0 S2 4 4 0 1 40
Zj
Cj-Zj

Using Pivot element


make the
corresponding value as
zero
CB Cj 6 8 0 0
Solution Ratio
Basic X1 X2 S1 S2
Variable
8 X2 ½ 1 1/10 0 6 6/ (1/2) = 12
0 S2 4-(4*1/2)=2 4-(1*4)=0 -2/5 1 16 16/2 = 8
Zj 4 8 4/5 0 8*6 = 48
Cj-Zj 2 0 -4/5 0
CB Cj 6 8 0 0
Solution
Basic X1 X2 S1 S2
Variable
8 X2 0 1 1/5 -1/4 2
6 X1 1 0 -1/5 1/2 8
Zj 6 8 2/5 1 64
Cj-Zj 0 0 -2/5 -1/5

X1 = 8 and X2 = 2
Max Z = 6(X1)+8(X2)
Max Z= 6*8 + 8*2 = 64

You might also like