Scribd
Upload
2 views43 pages

5 Module 5 Unit 3 Linear Programming Simplex Method-1

The document outlines a linear programming model using the graphical method, detailing the steps to determine optimal solutions through tableau computations. It includes constraints related to materials and profits for two designs, along with a series of tableau transformations to reach the final solution. The process involves identifying pivot columns and rows to compute new tableaux until an optimal solution is achieved.

Uploaded by

alleiyah1206
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
2 views43 pages

5 Module 5 Unit 3 Linear Programming Simplex Method-1

The document outlines a linear programming model using the graphical method, detailing the steps to determine optimal solutions through tableau computations. It includes constraints related to materials and profits for two designs, along with a series of tableau transformations to reach the final solution. The process involves identifying pivot columns and rows to compute new tableaux until an optimal solution is achieved.

Uploaded by

alleiyah1206
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

01 02 03

Unit I: Unit II: Unit III: Linear


Preliminaries Determination of Programming
Optimizing Models Models –
Graphical Method
At the end of the unit, the student can:
Are there
negative
Set up the initial YES Determine the
entries in
tableau pivot column.
the last
row?

NO
The solution is
End
optimal. Are there
positive
No finite solution NO
End entries in
exists.
the test
Computes a new Determine the YES ratio?
tableau. pivot pivotal row.
Materials Design A (X1) Design B (X2) Available
Cotton 3 2 18
Silk 2 4 20
Wool 1 0 5
Profit ₱1,200 ₱1,600
BV X1 X2 S1 S2 S3 P RHS
S1 3 2 1 0 0 0 18 1st Constraint
S2 2 4 0 1 0 0 20 2nd Constraint
S3 1 0 0 0 1 0 5 3rd Constraint
P -1,200 -1,600 0 0 0 1 0 Objective Function
BV X1 X2 S1 S2 S3 P RHS
S1 3 2* 1 0 0 0 18
S2 2 4* 0 1 0 0 20
S3 1 0* 0 0 1 0 5
P -1,200 -1,600* 0 0 0 1 0
BV X1 X2 S1 S2 S3 P RHS Test Ratio
S1 3 2 1 0 0 0 18 18 ÷ 2 = 9
S2 2 4 0 1 0 0 20 20 ÷ 4 = 5*
S3 1 0 0 0 1 0 5 5 ÷ 0 = not permissible
P -1,200 -1,600 0 0 0 1 0
BV X1 X2* S1 S2 S3 P RHS
S1 3 2 1 0 0 0 18
S2* 2 4* 0 1 0 0 20
S3 1 0 0 0 1 0 5
P -1,200 -1,600 0 0 0 1 0
BV X1 X2 S1 S2 S3 P RHS
S1 3 2 1 0 0 0 18 ← R11
S2 2 4 0 1 0 0 20 ← R21
S3 1 0 0 0 1 0 5 ← R31
P -1,200 -1,600 0 0 0 1 0 ← R41
BV X1 X2 S1 S2 S3 P RHS
S1 3 2 1 0 0 0 18 ← R11
S2 2 4 0 1 0 0 20 ← R21
S3 1 0 0 0 1 0 5 ← R31
P -1,200 -1,600 0 0 0 1 0 ← R41
BV X1 X2 S1 S2 S3 P RHS
S1 3 2 1 0 0 0 18 ← R11
S2 2 4 0 1 0 0 20 ← R21
S3 1 0 0 0 1 0 5 ← R31
P -1,200 -1,600 0 0 0 1 0 ← R41
BV X1 X2 S1 S2 S3 P RHS
S1 3 2 1 0 0 0 18 ← R11
S2 2 4 0 1 0 0 20 ← R21
S3 1 0 0 0 1 0 5 ← R31
P -1,200 -1,600 0 0 0 1 0 ← R41
BV X1 X2 S1 S2 S3 P RHS
S1 3 2 1 0 0 0 18 ← R11
S2 2 4 0 1 0 0 20 ← R21
S3 1 0 0 0 1 0 5 ← R31
P -1,200 -1,600 0 0 0 1 0 ← R41
BV X1 X2 S1 S2 S3 P RHS
S1 2 0 1 -½ 0 0 8 ← R12
X2 ½ 1 0 ¼ 0 0 5 ← R22
S3 1 0 0 0 1 0 5 ← R32
P -400 0 0 400 0 1 8000 ← R42
BV X1 X2 S1 S2 S3 P RHS Test Ratio
S1 2 0 1 -½ 0 0 8 8÷2=4
X2 ½ 1 0 ¼ 0 0 5 5 ÷ ½ = 10
S3 1 0 0 0 1 0 5 5÷1=5
P -400 0 0 400 0 1 8000
BV X1 X2 S1 S2 S3 P RHS
S1 2 0 1 -½ 0 0 8 ← R12
X2 ½ 1 0 ¼ 0 0 5 ← R22
S3 1 0 0 0 1 0 5 ← R32
P -400 0 0 400 0 1 8000 ← R42
BV X1 X2 S1 S2 S3 P RHS
S1 2 0 1 -½ 0 0 8 ← R12
X2 ½ 1 0 ¼ 0 0 5 ← R22
S3 1 0 0 0 1 0 5 ← R32
P -400 0 0 400 0 1 8000 ← R42
BV X1 X2 S1 S2 S3 P RHS
S1 2 0 1 -½ 0 0 8 ← R12
X2 ½ 1 0 ¼ 0 0 5 ← R22
S3 1 0 0 0 1 0 5 ← R32
P -400 0 0 400 0 1 8000 ← R42
BV X1 X2 S1 S2 S3 P RHS
S1 2 0 1 -½ 0 0 8 ← R12
X2 ½ 1 0 ¼ 0 0 5 ← R22
S3 1 0 0 0 1 0 5 ← R32
P -400 0 0 400 0 1 8000 ← R42
BV X1 X2 S1 S2 S3 P RHS
S1 2 0 1 -½ 0 0 8 ← R12
X2 ½ 1 0 ¼ 0 0 5 ← R22
S3 1 0 0 0 1 0 5 ← R32
P -400 0 0 400 0 1 8000 ← R42
BV X1 X2 S1 S2 S3 P RHS
X1 1 0 ½ -¼ 0 0 4 ← R 13
X2 0 1 -¼ 3/8 0 0 3 ← R23
S3 0 0 -½ ¼ 1 0 1 ← R33
P 0 0 200 300 0 1 9600 ← R43
BV X1 X2 S1 S2 S3 P RHS
X1 1 0 ½ -¼ 0 0 4
X2 0 1 -¼ 3/8 0 0 3
S3 0 0 -½ ¼ 1 0 1
P 0 0 200 300 0 1 9600

You might also like