Scribd
Upload
13 views7 pages

Man. Sci. Simplex Method

The document describes solving two linear programming problems to maximize an objective function subject to constraints. The first problem minimizes Z=15x+30y subject to constraints, and the optimal solution is found to be x=50, S1=65, S2=20 with minimum Z of 750. The second problem maximizes Z=45x+69y subject to other constraints, and the optimal solution is found to be x=200, Y=130, S3=10 with maximum Z of 17970.

Uploaded by

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

Man. Sci. Simplex Method

The document describes solving two linear programming problems to maximize an objective function subject to constraints. The first problem minimizes Z=15x+30y subject to constraints, and the optimal solution is found to be x=50, S1=65, S2=20 with minimum Z of 750. The second problem maximizes Z=45x+69y subject to other constraints, and the optimal solution is found to be x=200, Y=130, S3=10 with maximum Z of 17970.

Uploaded by

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

Minimize Z =15x + 30y

Subject to:
x + y = 50
x ≤ 65
y ≤ 70

Objective Function = 15x+ 30y + 0S1 + 0S2 + 1A1


Subject to:
x + y +1A1 = 50
x + 0S1 = 65
y + 0S2 = 70

Table 1 Cj 15 30 0 0 100
Prod. Qty. x y S1 S2 A1
100 A1 50 1 1 0 0 1
0 S1 65 1 0 1 0 0
0 S2 70 0 1 0 1 0
Zj 5000 100 100 0 0 100
Cj-Zj -85 -70 0 0 0

Pivotal Row:

50 / 1 = 50

65 / 1 = 65

70 / 0 = 0

Zj:

10 ( 50 1 1 0 0 1) = 5000 100 100 0 0 100


0

0 ( 65 1 0 1 0 0) = 0 0 0 0 0 0

0 ( 70 0 1 0 1 0) = 0 0 0 0 0 0

5000 100 100 0 0 100


Cj-Zj:

Cj 15 30 0 0 100

Zj 100 100 0 0 100

-85 -70 0 0 0

Table 2:

Replacing Row

50 1 1 0 0 1 /1

50 1 1 0 0 1

New S2:

70 0 1 0 1 0

50 1 1 0 0 1 (-1)

20 -1 0 0 1 -1

Table 2 Cj 15 30 0 0 100
Prod. Qty. X Y S1 S2 A1
15 X 50 1 1 0 0 1
0 S1 65 1 0 1 0 0
0 S2 20 -1 0 0 1 -1
Zj 750 15 15 0 0 15
Cj-Zj 0 15 0 0 85

Zj:

15 ( 50 1 1 0 0 1) = 750 15 15 0 0 15

0 ( 65 1 0 1 0 0) = 0 0 0 0 0 0

0 ( 20 -1 0 0 1 -1 ) = 0 0 0 0 0 0

750 15 15 0 0 15
Cj-Zj:

Cj 15 30 0 0 100

Zj 15 15 0 0 15

0 15 0 0 85

Optimal Solution:

Table 2 Cj 15 30 0 0
Prod. Qty. X Y S1 S2
15 X 50 1 1 0 0
0 S1 65 1 0 1 0
0 S2 20 -1 0 0 1
Zj 750 15 15 0 0
Cj-Zj 0 15 0 0

Decision:

X = 50

S1 = 65

S2 = 20

Min.Z = P750

Maximize Z = 45x + 69y


Subject to:
x ≤ 200
y ≤ 130
x + y ≤ 340

Objective Function = 42x+ 60y + 0S1 + 0S2 + 0S3


Subject to:
x + 0S1 = 200
y + 0S2 = 130
x + y + 0S3 = 34
Table 1 Cj 45 69 0 0 0
Prod. Qty. X Y S1 S2 S3
0 S1 200 1 0 1 0 0
0 S2 130 0 1 0 1 0
0 S3 340 1 1 0 0 1
Zj 0 0 0 0 0 0
Cj-Zj 45 69 0 0 0

Pivotal Row:

200 /0 = 0

130 /1 = 130

340 /1 = 340

Zj
:

0 ( 200 1 0 1 0 0) = 0 0 0 0 0

0 ( 130 0 1 0 1 0) = 0 0 0 0 0

0 ( 340 1 1 0 0 1) = 0 0 0 0 0

0 0 0 0 0

Cj-Zj:

Cj 45 69 0 0 0

Zj 0 0 0 0 0

45 69 0 0 0

Table 2:

Replacing Row

130 0 1 0 1 0 /1

130 0 1 0 1 0
New S3:

340 1 1 0 0 1

130 0 1 0 1 0 (-1)

210 1 0 0 -1 1

Table 2 Cj 45 69 0 0 0
Prod. Qty. X Y S1 S2 S3
0 S1 200 1 0 1 0 0
69 Y 130 0 1 0 1 0
0 S3 210 1 0 0 -1 1
Zj 8970 0 69 0 69 0
Cj-Zj 45 0 0 -69 0

Pivotal Row:

200 /2 = 200

130 /0 = 0

210 /1 = 210

Zj:

0 ( 200 1 0 1 0 0) = 0 0 0 0 0 0

69 ( 130 0 1 0 1 0) = 8970 0 69 0 69 0

0 ( 210 1 0 0 -1 1) = 0 0 0 0 0 0

8970 0 69 0 69 0
Cj-Z:j

Cj 45 69 0 0 0

Zj 0 69 0 69 0

45 0 0 -69 0

Table 3:

Replacing Row

200 1 0 1 0 0 /1

200 1 0 1 0 0

New S3:

210 1 0 0 -1 1

200 1 0 1 0 0 (-1)

10 0 0 -1 -1 1

Table 3 Cj 45 69 0 0 0
Prod. Qty. X Y S1 S2 S3
45 X 200 1 0 1 0 0
69 Y 130 0 1 0 1 0
0 S3 10 0 0 -1 -1 1
Zj 17970 45 69 45 69 0
Cj-Zj 0 0 -45 -69

Zj:

45 ( 200 1 0 1 0 0) = 9000 45 0 45 0 0

69 ( 130 0 1 0 1 0) = 8970 0 69 0 69 0

0 ( 10 0 0 -1 -1 1) = 0 0 0 0 0 0

17970 45 69 45 69 0
Cj-Zj:

Cj 45 69 0 0 0

Zj 45 69 45 69 0

0 0 -45 -69 0

Decision:

X = 200

Y = 130

S3 = 10

Max.
P17970
Z =

You might also like