Scribd
Upload
39 views

+0s1+0s2+0s3 +s1 + s2 + s3, s1, s2, s3

This document summarizes solving a linear programming problem using the simplex method to maximize profit. It provides the objective function and constraints. Over 4 iterations, it performs the simplex method calculations, identifying the entering and leaving variables at each step. The optimal solution is found on the 4th iteration, with maximum profit of $6,600 when x1=80, x2=40, x3=80 and all slacks equal 0.

Uploaded by

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

+0s1+0s2+0s3 +s1 + s2 + s3, s1, s2, s3

This document summarizes solving a linear programming problem using the simplex method to maximize profit. It provides the objective function and constraints. Over 4 iterations, it performs the simplex method calculations, identifying the entering and leaving variables at each step. The optimal solution is found on the 4th iteration, with maximum profit of $6,600 when x1=80, x2=40, x3=80 and all slacks equal 0.

Uploaded by

abdulla mohammad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Solve the following LP problem using the simplex Method

Maximize Z= 35$ X1 +45$ X2 + 25$ X3


S. to :
2X1 + 3X2 + X3 ≤ 360
X2 + 2X3 ≤ 200
X1 ≤ 80
x1,x2,x3≥ 0

Maximize Z= 35$ X1 +45$ X2 + 25$ X3 +0s1+0s2+0s3


S. to :
2X1 + 3X2 + X3 +s1 = 360
X2 + 2X3 + s2 = 200
X1 + s3 = 80
x1,x2,x3,s1,s2,s3≥ 0

Cj $ 35 $ 45 $ 25 0 0 0
Basic Solution x1 x2 x3 s1 s2 s3 Quantity
0 S1 2 3 1 1 0 0 360
0 S2 0 1 2 0 1 0 200
0 S3 1 0 0 0 0 1 80
Zj 0 0 0 0 0 0 0
Cj-Zj $ 35 $ 45 $ 25 $ - $ - $ -
The first simplex tabluae is not optimal because there is positive values in Cj - Zj row

Cj $ 35 $ 45 $ 25 0 0 0
Basic Solution x1 x2 x3 s1 s2 s3 Quantity
45 X2 2/3 1 1/3 1/3 0 0 120
0 S2 - 2/3 0 1 2/3 - 1/3 1 0 80
0 S3 1 0 0 0 0 1 80
Zj 30 45 15 15 0 0 5400
Cj-Zj $ 5 $ - $ 10 $ (15) $ - $ -
The second simplex tabluae is not optimal because there is positive values in Cj - Zj row

Cj $ 35 $ 45 $ 25 0 0 0
Basic Solution x1 x2 x3 s1 s2 s3 Quantity
45 X2 4/5 1 0 2/5 - 1/5 0 104
25 X3 - 2/5 0 1 - 1/5 3/5 0 48
0 S3 1 0 0 0 0 1 80
Zj 26 45 25 13 6 0 5880
Cj-Zj $ 9 $ - $ - $ (13) $ (6) $ -
The third simplex tabluae is not optimal because there is positive values in Cj - Zj row
Cj $ 35 $ 45 $ 25 0 0 0
Basic Solution x1 x2 x3 s1 s2 s3 Quantity
45 X2 0 1 0 2/5 - 1/5 - 4/5 40
25 X3 0 0 1 - 1/5 3/5 2/5 80
35 X1 1 0 0 0 0 1 80
Zj 35 45 25 13 6 9 6600
Cj-Zj $ - $ - $ - $ (13) $ (6) $ (9)
The fourth simplex tabluae is optimal because there is no positive values in Cj - Zj row
Ratio
120
200
#DIV/0!

new no. = old no. - ( corresponding with old pivot column*corresponding with new pivot row)

Ratio
360
48
#DIV/0!

Ratio
130
#######
80
The solution is Maximum profit = 6600$
x1=80
x2=40
x3=80
s1=s2=s3=0 no slack for all constraints

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy