Meditacio F. Monto Jr.

BSA III-01
CASE STUDY
Problem:
A computer service company wishes to repair two models of computer: Model A
and Model B. Every Model A computer will result to P500.00 profit and every Model B
computer will result to P400.00 profit. To repair a Model A computer 1 hour on monitor, 1
hour on central processing unit (CPU), and 2 hours on programming deficiency. A Model B
computer requires 2 hours on monitor, 1 hour on central processing unit (CPU), and 1
hour on program deficiency. There are 30 hours on computer, 15 hours on central
processing unit (CPU), and 45 hours on program deficiency for repairing. How many
computers of each model should the company repair in order to maximize profit?
Solution:
Let X1 be the number of Model A computers, and
X2 be the number of Model B computers.
Materials
Model A (X1)
Model B (X2)
Monitor
1
2
CPU
1
1
Program
2
1
Deficiency
Profit
500
400

Available
30
15
45

Objective function:
Maximize: P= 500X1 + 400X2
The constraints are:
X1 +2 X2 30
X1 +2 X2 + S1
= 30
X1 + X2 15
X1 + X2
+S2
= 15
2X1 + X2 45
2X1 + X2
+S3
= 45
X1, X2 0
-500X1 - 400X2
+P
=0
TABLEAU 1
BV
X1
X2
S1
S2
S3
P
RHS
Test Ratio
S1
1
2
1
0
0
0
30
301= 30
S2
1
1
0
1
0
0
15
151= 15
S3
2
1
0
0
1
0
45
452=22.5
P
-500
-400
0
0
0
1
R22= R211= (1,1,0,1,0,0,15)1= (1,1,0,1,0,0,15)
R12= R11- R22= (1,2,1,0,0,0,30)- (1,1,0,1,0,0,15)= (0,1,1,-1,0,0,15)
R32= R31- 2R22= (2,1,0,0,1,0,45)-2(1,1,0,1,0,0,15)= (1,1,0,1,0,0,15)- (2,2,0,2,0,0,30)= (0,1,0,-2,1,0,15)
R42= R41+500 R22= (-500,-400,0,0,0,1,0)+ 500(1,1,0,1,0,0,15)= (-500,-400,0,0,0,1,0)+
(500,500,0,500,0,0,7500)
= (0,100,0,500,0,1,7500)
FINAL SIMPLEX TABLEAU
BV
X1
X2
S1
S1
0
1
1

S2
-1

S3
0

P
0

RHS
30

X2
1
1
0
S3
0
-1
0
P
0
100
0
A. RANGE OF OPTIMALITY

1
-2
500

0
1
0

FINAL SIMPLEX TABLEAU with C1= 500

BV
X1
X2
S1
S2
S1
0
1
1
-1
S2
1
1
0
1
S3
0
-1
0
-2
P
0
100
0+ 500

+
S3
0
0
1
0

0
0
1

P
0
0
0
1

15
15
7500
0+ > 0
> 0
> 0
C1- 500>
= C1- 500 0
> 0
C1 >
RHS
30
500- > 0
<
15
500
15
-> -500
C17500+
500< 500
30
< 50
C1 <

500< C1< 1000

FINAL SIMPLEX TABLEAU with C2= 400
BV
X1
X2
S1
S2
S1
0
1
1
-1
S2
1
1
0
1
S3
0
-1
0
-2
P
0
100
0
500+

+
S3
0
0
1
0

P
0
0
0
1

= C1- 400
RHS
30
15
15
7500+
15

S3
0
0
1
0

P
0
0
0
1

= Q1- 30
RHS
30+ 1
15+ 0
15+ 0
7500+
0

FINAL SIMPLEX TABLEAU with C2= 15 +

BV
X1
X2
S1
S2
S3
S1
0
1
1
-1
0
S2
1
1
0
1
0
S3
0
-1
0
-2
1
P
0
100
0
500
0

P
0
0
0
1

= C1- 15
RHS
30-
15+
15- 2
7500+
500

500+ > 0
> -500
> -500
-500

C2- 400>
C2> -500+

C2> -100
B. RANGE OF FEASIBILITY
FINAL SIMPLEX TABLEAU with Q1= 30+
BV
X1
X2
S1
S2
S1
0
1
1
-1
S2
1
1
0
1
S3
0
-1
0
-2
P
0
100
0
500

30+ 0
-30
> -30

Q1- 30 -30
Q1 -30+

30

Q2> 0

30- 0
30
- -30
30
30- 15

Q2- 15 30
Q2

15+ 0
-15
-15

Q2- 15 -15
Q2 -15+

15
Q2 30 15

30- 2 0
15
-2 -30
15
15

Q2- 15 15
Q2 15+

C. DUALITY OF THE LPM

M-

M=

Minimize: C= 30Y1+ 15Y2+ 45Y3

Y1+ Y2+ 2Y3 -S1
=500
Subject to: Y1+ Y2+ 2Y3 500
2Y1+ Y2+ Y3
-S2
=400
2Y1+ Y2+ Y3 400
30Y1+ 15Y2+ 45Y3
+P
=0
TABLEAU 1
BV
Y1
Y2
Y3
S1
S2
P
RHS
Test Ratio
S1
1
1
2
-1
0
0
500
5002= 250
S2
2
1
1
0
-1
0
400
4001= 400
P
30
15
45
0
0
1
0
R12= R112= (1,1,2,-1,0,0,500)2= (0.5,0.5,1,-0.5,0,0,250)
R22= R21- R12= (2,1,1,0,-1,0,400)- (0.5,0.5,1,-0.5,0,0,250)= (1.5,0.5,0,0.5,-1,0,150)
R32= R31- 45R12= (30,15,45,0,0,1,0)-45(0.5,0.5,1,-0.5,0,0,250)= (30,15,45,0,0,1,0)(22.5,22.5,45,-22.5,0,0,11250)= (7.5,-7.5,0,-22.5,0,1,-11250)
TABLEAU 2
BV
Y1
Y3
0.5

Y2
0.5

Y3
1

S1
-0.5

S2
0

P
0

RHS
250
150

S2

1.5

0.5

0.5

-1

7.5

-7.5

-22.5

Y2

Y3

S1

S2

Test Ratio
2500.5=50
0
1501.5=10
0

1125
0
3
2
R2 = R2 1.5= (1.5,0.5,0,0.5,-1,0,150)1.5= (1,0.33,0,-1,-0.67,0,100)
R13= R21- 0.5R23= (0.5,0.5,1,-0.5,0,0,250)- 0.5(1,0.33,0,-1,-0.67,0,100)= ( , , , ,
, , )
R33= R31- 7.5R23= (7.5,-7.5,0,-22.5,0,1,-11250)-7.5(1,0.33,0,-1,-0.67,0,100)= ( ,
,
,
, , , )
TABLEAU 3
BV
Y1
Y3
Y1
P

RHS

Test Ratio