Professional Documents
Culture Documents
GOllena, Rizalte BSIT II-3 PDF
GOllena, Rizalte BSIT II-3 PDF
Bulan campus
Bulan, Sorsogon
Information and Communications Technology/Education Department
QUANTITATIVE METHODS
2nd Semester, S.Y. 2019 – 2020
Problem Set 1
LINEAR PROGRAMMING: GRAPHICAL AND SIMPLEX METHOD
DIRECTION: This problem set will test your knowledge in solving linear programming
problems. Each problem is worth 25 points. You can work in pairs or individually. Use long
size bond paper for your solutions. Label each step of your solution and make sure that
each solution is clear and readable.
Submission is due on March 6, 2020, 11 PM. Late submissions will NOT be accepted.
Table 1
Men’s
5 minutes 7 minutes 9 minutes $6
Shampoo(x)
Women’s
10 minutes 7 minutes 5 minutes $8
Shampoo(y)
100 minutes 84 minutes 90 minutes
Max z = $6 + $8
Subject to:
5x + 10y <= 100
7x + 7y <= 84
9x + 5y <= 90
x, y >= 0
x-intercept y-intercept
5x + 10y <= 100 5x + 10y <= 100
5x + 10(0) = 100 5(0) + 10y = 100
5x = 100 10y = 100
5 5 10 10
x =20 y = 10
7x + 7y <= 84 7x + 7y <= 84
7x + 7(0) = 84 7(0) + 7y = 84
7x = 84 7y = 84
7 7 7 7
x = 12 y = 12
9x + 5y <= 90 9x + 5y <= 90
9x + 5(0) = 90 9(0) + 5y = 90
9x = 90 5y = 90
9 9 5 5
x = 10 y = 18
Table 1.1
x-intercept y-intercept
5x + 10y <= 100 (20,0) (0,10)
7x + 7y <= 84 (12,0) (0,12)
9x + 5y <= 90 (10,0) (0,18)
x >= 0 (0,0) (0,0)
y >= 0 (0,0) (0,0)
y
20
19
18 (0,18)
17
16
15
14
13 (0,12)
12
11
10 B(0,10)
9 C(4,8)
8
7
6
5 D(7 1/2,4 1/2)
4
3 Feasible Region
2
1 E (10,0) (20,0)
0 (12,0)
A(0,0)
-3 -2 -1-1 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
-2 5x + 10y <= 100
-3
☓ + 5y <= 90
9x 7x + 7y <= 84
x = 10 - 5y/9 x = 12 - y
x = 10 - 5(4 ½)/9 x = 12 – (4)
x=7½ x=8
Table 1.2
Points Max z = $ 6x + $ 8y
A(0,0) Max z = 0
B(0,10) Max z = 80
C(4,8) Max z = 88
D(7 ½,4 ½) Max z =
E(10,0) Max z = 60
[ PROBLEM 2 ] Coca-Cola
Yumilka Ruiz is the Head Buyer of Coca-Cola and she wants to determine the
supply mix that will result on minimum cost. She is able to determine the data necessary
for her to make a decision. A kilogram of Equal ® sweetener can produce 4 liters of Coke
Lite, 6 liters of Sprite Lite, and 10 liters of Coke Zero. A kilogram of Nutra® sweetener can
produce 12 liters of Coke Lite, 8 liter of Sprite Lite, and 5 liter of Coke Zero. Yumilka must
produce at least 96 liters of Coke Lite, 96 liters of Sprite Lite, and 100 liters of Coke Zero
per day. Equal ® sweetener costs $27 per kilogram while Nutra® sweetener costs $30 per
kilogram.
How many kilograms of Equal ® sweetener and Nutra® sweetener should she
purchase per day to minimize costs? How much is the total cost?
96 96 100
Objective Function
Min z = $ 27x + $ 30y
Subject to:
4x + 12y ≥ 96 4x + 12y – S1 + A1 = 96
6x + 8y ≥ 96 6x + 8y – S2 + A2 = 96
10x + 5y ≥ 100 10x + 5y – S3 + A3 = 100
x, y ≥ 0 x,y,S1,S2,S3,A1,A2,A3 ≥ 0
Table 1
Quantit 20 22 0 0 0 100 100 100 Quantity
Pj Product Column
y x y s1 s2 s3 a1 a2 a3
100 a1 90 9 5 -1 0 0 1 0 0 18
100 a2 128 8 8 0 -1 0 0 1 0 16
100 a3(y) 88 4 11 0 0 -1 0 0 1 8
Zj 30600 2100 2400 -100 -100 -100 100 100 100
Pj-Zj -2080 -2378 100 100 100 0 0 0
New PR3 88 4 11 0 0 -1 0 0 1
Pivot
Row3 8 4/11 1 0 0 -1/11 0 0 1/11
New OR1 90 9 5 -1 0 0 1 0 0
Pivot -40 -1 9/11 -5 0 0 5/11 0 0 -5/11
Row1 50 7 2/11 0 -1 0 5/11 1 0 -5/11
Table 2
20 22 0 0 0 100 100 100 Quantity
Pj Product Quantity
x y s1 s2 s3 a1 a2 a3 Column
Table 3
20 22 0 0 0 100 100 100 Quantity
Pj Product Quantity
x y s1 s2 s3 a1 a2 a3 Column
Table 4
20 22 0 0 0 100 100 100 Quantity
Pj Product Quantity
x y s1 s2 s3 a1 a2 a3 Column
Table 1
100 a1 96 4 12 -1 0 0 1 0 0 8
100 a2 96 6 8 0 -1 0 0 1 0 12
100 a3 100 10 5 0 0 -1 0 0 1 20
Zj 29200 2000 2500 -100 -100 -100 100 100 100
Pj-Zj -1973 -2470 100 100 100 0 0 0
New PR1 96 4 12 -1 0 0 1 0 0
Pivot
Row1 8 1/3 1 -1/12 0 0 1/12 0 0
New OR2 96 6 8 0 -1 0 0 1 0
Pivot -64 -2 2/3 -8 2/3 0 0 -2/3 0 0
Row2 32 3 1/3 0 2/3 -1 0 -2/3 1 0
Table 2
27 30 0 0 0 100 100 100 Quantity
Pj Product Quantity Column
x y s1 s2 s3 a1 a2 a3
30 a1 8 1/3 1 -1/12 0 0 1/12 0 0 24
100 a2 32 3 1/3 0 2/3 -1 0 -2/3 1 0 9 3/5
100 a3 60 8 1/3 0 5/12 0 -1 -5/12 0 1 7 1/5
Zj 9440 1176 2/3 30 105 5/6 -100 -100 -105 5/6 100 100
Pj-Zj -1149 2/3 0 -105 5/6 100 100 205 5/6 0 0
Table 3
27 30 0 0 0 100 100 100 Quantity
Pj Product Quantity
x y s1 s2 s3 a1 a2 a3 Column
4. Geronimo-Guidicelli Company
Geronimo-Guidicelli produces both interior and exterior paints from two raw
materials, M1 and M2. The following table provides the basic data of the problem:
The daily demand for interior paint cannot exceed that for exterior paint by more than 1
ton. Also, the maximum daily demand for interior paint is 2 tons. Geronimo-Guidicelli
wants to determine the optimum (best) product mix of interior and exterior paints that
maximizes the total daily profit.
The linear programming model as expressed in equation form:
Subject to
x1,x2,s1,s2,s3,s4 ≥ 0
The variables s1,s2,s3 and s4 are the slacks associated with the respective constraints.
Table 1
5 4 0 0 0 0 Quantity
Pj Product Quantity
x1 x2 s1 s2 s3 s4 Column
0 s1 24 6 4 1 0 0 0 4
0 s2 6 1 2 0 1 0 0 6
0 s3 1 -1 1 0 0 1 0 -1
0 s4 2 0 1 0 0 0 1 disregard
Zj 0 0 0 0 0 0 0
Pj-Zj 5 4 0 0 0 0
PR1 24 6 4 1 0 0 0
NPW
NPW1 4 1 2/3 1/6 0 0 0
New OR2 6 1 2 0 1 0 0
Pivot -4 -1 -2/3 -1/6 0 0 0
Row2
2 0 1 1/3 -1/6 1 0 0
New OR3 1 -1 1 0 0 1 0
Pivot 4 1 2/3 1/6 0 0 0
Row3
5 0 1 2/3 1/6 0 1 0
New OR4 2 0 1 0 0 0 1
Pivot 0 0 0 0 0 0 0
Row4
2 0 1 0 0 0 1
Table 2
5 4 0 0 0 0 Quantity
Pj Product Quantity Column
x1 x2 s1 s2 s3 s4
5 s1 4 1 2/3 1/6 0 0 0 6
0 s2 2 0 1 1/3 -1/6 1 0 0 1½
0 s3 5 0 1 2/3 1/6 0 1 0 3
0 s4 2 0 1 0 0 0 1 2
Zj 20 5 3 1/3 5/6 0 0 0
Pj-Zj 0 2/3 -5/6 0 0 0
New OR4 2 0 1 0 0 0 1
Pivot -1 1/2 0 -1 1/8 -3/4 0 0
Row4 1/2 0 0 1/8 -3/4 0 1
Table 3
5 4 0 0 0 0 Quantity
Pj Product Quantity Column
x1 x2 s1 s2 s3 s4
5 s1(x1) 3 1 0 1/4 -1/2 0 0 disregard
4 s2(x2) 1½ 0 1 -1/8 3/4 0 0 disregard
0 s3 2½ 0 0 3/8 -1 1/4 1 0 disregard
0 s4 ½ 0 0 1/8 -3/4 0 1 1/2
Zj 21 5 4 3/4 1/2 0 0
Non-
Pj-Zj 0 0 -3/4 -1/2 0 0
negative
S1 (x1) -> 3
S2 (x2) -> 1 1/2
Maximization -> 21