Scribd
Upload
120 views3 pages

Simplex Method for LPP Optimization

The document describes using the Simplex Method to solve a linear programming problem (LPP) to maximize Z=40x1+35x2 subject to constraints. The method selects x1 as the entering variable since its coefficient in the objective function is largest. It identifies x1's column as the key column. Using the key column and key row, it calculates the leaving variable as x2 and the new basis. The process results in an optimal solution of x1=24, x2=8, Z=1000.

Uploaded by

akhil
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
120 views3 pages

Simplex Method for LPP Optimization

The document describes using the Simplex Method to solve a linear programming problem (LPP) to maximize Z=40x1+35x2 subject to constraints. The method selects x1 as the entering variable since its coefficient in the objective function is largest. It identifies x1's column as the key column. Using the key column and key row, it calculates the leaving variable as x2 and the new basis. The process results in an optimal solution of x1=24, x2=8, Z=1000.

Uploaded by

akhil
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Simplex Method to Solve LPP

Maximize Z = 40x1+35x2 Maximize Z = 40x1 +35x2 +0s1 +0s2

subject to 2x1+3x2<=60 St. to 2x1+3x2 +s1= 60


4x1+3x2<=96 4x1+3x2 +s2 = 96
x1, x2>=0 x1, x2, s1,s2 >=0

Cj 40 35 0 0
40 is my maximum
Basis CB x1 x2 s1 s2 bi number so, x1 it is
selected as my entering
variable.
s1 0 2 3 1 0 60 60/2=30
therefore x1 column is
my key column, so
s2 0 4 3 0 1 96 24 divide each element of
bi by respective element
of key column and find
Zj 0 0 0 0 0 the smallest number as
out going variable.

Cj-Zj 40 35 0 0 out going row is the Key


Row. Intersection of key
row and key column
s1 0 0 3/2 1 -1/2 12 gives you Key element

The value of the


x1 40 1 3/4 0 1/4 24 entering variable is
calculated by dividing
the elements of the
Zj 40 30 0 10 960 outgoing row by the key
element

Cj-Zj 0 5 0 -10
Calculation of old element in the table
(s1): rough work

old row elemnt Minus Row Element in key column * New Value = New Element
2 - 2 *1 =0

3 - 2 * 3/4 = 3/2

1 - 2 *0 = 1
0 - 2 * 1/4 = -1/2

60 - 2 * 24 = 12

old row elemnt Minus Row Element in key column * New Value = New Element
1 - 3/4 *0 =1

3/4 - 3/4 *1 =0

0 - 3/4 * 2/3 = -1/2


1/4 - 3/4 * -1/3 = 1/2

24 - 3/4 *8 = 18
Cj 40 35 0 0

Basis cb x1 x2 s1 s2 bi

x2 35 0 1 2/3 -1/3 8

x1 40 1 0 -1/2 1/2 18

Zj 40 35 10/3 25/3 1000

Cj-Zj 0 0 -10/3 -25/3

You might also like