HONSON, ALYSSA MAE B.

CBET-01-601A
Activity 3D

Cost (X1) = 60 minutes / 20 minutes = 3; P18.00 / 3 = 6 +250 = P256

Cost (X2) = 60 minutes/ 15minutes = 4; P20.00/ 4 = 5 +300 = P305

Let X1 be the number of set of parts of X1 to be produced to minimize cost

Let X2 be the number of set of parts of X2 to be produced to minimize cost

Linear Program
Minimize C = P256x1 + P305x2

Subject to:
x1 ≤ 50
x2 ≥ 50
x1 + x2 = 100
x1,x2 ≥ 0

Convert the inequalities to equalities by adding slack and artificial variable.

x1 +S1 = 50
x2 - S2 + A1= 50
x1 + x2 + A2 = 100

Modified objective functions and constraints

Z = P256x1 + P305x2 + P0S1 + P0S2 + PmA1+ PmA2
50= x1 + 0x2 + S1 + 0S2 + 0A1+ 0A2
50 = 0x1 + x2 + 0S1 - 0S2 + A1+ 0A2
100 =x1 + x2 + 0S1 + 0S2 + 0A1+ 1A2
Cj P256 P305 P0 P0 m m
Pm Qty x1 x2 S1 S2 A1 A2
P0 S1 50 1 0 1 0 0 0
m A1 50 0 1 0 -1 1 0
m A2 100 1 1 0 0 0 1
Zj 150m m 2m 0 -m m m
Cj-Zj 256-m 305-2m 0 m -m -m
Assume m= 400
Replacing row(X2) = Same values IE = 1
Remaining row (S1) = Same values IE = 0

A2 Row
100-50= 50
1-0=1
1-1=0
 0-0=0
0-(-1)=1
0-1= -1
1-0=1

Cj P256 P305 P0 P0 m m
Pm Qty x1 x2 S1 S2 A1 A2
P0 S1 50 1 0 1 0 0 0
P305 X2 50 0 1 0 -1 1 0
m A2 50 1 0 0 1 -1 1
15250 +
Zj 50m m 305 0 m-305 305-m m
Cj-Zj 256-m 0 0 305-m 2m-305 0

Assume m= 400
Replacing row(X1) = Same values IE = 1
Remaining row (X2) = Same values IE = 0

S1 Row
50-50=0
1-1=0
0-0=0
1-0=1
0-1= -1
0-(-1)=1
0-1= -1

Cj P256 P305 P0 P0 m m
Pm Qty x1 x2 S1 S2 A1 A2
P0 S1 0 0 0 1 -1 1 -1
P305 X2 50 0 1 0 -1 1 0
P256 X1 50 1 0 0 1 -1 1
Zj 28,050 256 305 0 -49 49 256
Cj-Zj 0 0 0 49 m-49 m-256

Optimum Solution

X1 = 50 units
X2 = 50 units
Cost = P28,050