LINEAR PROGRAMMING MANSCI
10.18.21 QUIZ # 1
SOLVE THE FOLLOWING LINEAR PROGRAMMING PROBLEM BY
GRAPHICAL SOLUTION:
1. A Western shop wishes to purchase 300 felt and 200 straw cowboy
hats. Bids have been received from the wholesalers. Betta Hatters
has agreed to supply not more than 200 hats. Kappa Hatters not
more than 250. Delta Hatters not more than 150. The owner of the
shop has estimated that his profit per hat sold from Beta Hatters
would be P30/felt and P40/straw, from Kappa Hatters 38/felt and
P35/straw, and from Delta Hatters P40felt and P36/straw. Set up a
linear programming problem to maximize the owner’s profit.
I. Tabulation
SUPPLIERS FELT (x) STRAW(y) TOTAL
BETTA P 30 P 40 200
KAPPA P 38 P 35 250
DELTA P 40 P 36 150
300 200
II. FORMULATION
Objective Function: Zj = 300x + 200y
Structural Constraints: 30x + 40y ≤ 200
38x + 35y ≤ 250
40x + 36y ≤ 150
Negativity Constraints: x,y ≤ 0
30x + 40y ≤ 200 38x + 35y ≤ 250 40x + 36y ≤ 150
30x + 40y = 200 38x + 35y = 250 40x + 36y ≤ 150
If x = 0, y=? If x = 0, y=? If x = 0, y=?
40y = 200 35y = 250 36y = 150
y= 5, (0, 5) y = 7.1 or 50/7, (0, 7.1) y = 4.2 or 75/18 (0, 4.2)
If y = 0, x =? If y = 0, x =? If y = 0, x =?
JAZZMINE M. DALANGPAN
2020-08-0017 │ ACC 201
LINEAR PROGRAMMING MANSCI
10.18.21 QUIZ # 1
30x = 200 38x = 250 40x = 150
x = 6.7, (6.7, 0) x = 6.6, (6.6, 0) x = 3.8, (3.8, 0)
III. GRAPH
10
LEGENDS:
9
8 38x + 35y = 250
7 30x + 40y = 200
EXTREME
6 POINTS 40x + 36y ≤ 150
5
4 FEASIBLE
3 REGION
2
1
1 2 3 4 5 6 7 8 9 10
Extreme Points:
(0, 4.2): 300(0) + 200(4.2) = Php.840.00
(3.8, 0): 300(3.8) + 200(0) = Php.1, 140.00
JAZZMINE M. DALANGPAN
2020-08-0017 │ ACC 201
LINEAR PROGRAMMING MANSCI
10.18.21 QUIZ # 1
2. The Epsilon Company owns two mines: mine A produces 1 ton of
high grade ore, 3 tons of medium grade ore and 5 tons of low
grade ore each day; and mine B produces 2 tons of each of the
three grades of ore each day. The company needs 80 tons of
high grade ore, 160 tons of medium grade ore and 200 tons of low
grade ore. How many days should each mine be operated if it
costs P 2,000 per day to work each mine?
I. Tabulation
GRADES MINE A (x) MINE B (y) TOTAL
HIGH 1 2 80
MEDIUM 3 2 160
LOW 5 2 200
2000 2000
II. FORMULATION
Objective Function: Zj = 2000x + 2000y
Structural Constraints: x + 2y ≥ 80
3x + 2y ≥ 160
5x + 2y ≥ 200
Negativity Constraints: x,y ≤ 0
x + 2y ≥ 80 3x + 2y ≥ 160 5x + 2y ≥ 200
x + 2y = 80 3x + 2y = 160 5x + 2y = 200
If x = 0, y=? If x = 0, y=? If x = 0, y=?
2y = 80 2y = 160 2y = 150
y = 40, (0, 40) y = 80 (0, 80) y = 100 (0, 100)
If y = 0, x =? If y = 0, x =? If y = 0, x =?
x = 80 3x = 160 5x = 200
x = 80, (80, 0) x = 53.3, (53.3, 0) x = 40, (40, 0)
JAZZMINE M. DALANGPAN
2020-08-0017 │ ACC 201
LINEAR PROGRAMMING MANSCI
10.18.21 QUIZ # 1
III. GRAPH
100
LEGENDS:
90
x + 2y ≥ 80
80
EXTREME 3x + 2y ≥ 160
70
POINTS 5x + 2y ≥ 200
60
50
FEASIBLE
40 REGION
30
20
10
10 20 30 40 50 60 70 80 90 100
x + 2y = 80 (3) x + 2(20) = 80 3x + 2y = 160 (5) 3x + 2(50) = 160
3x + 2y = 160 (-1) x + 40 = 80 5x + 2y = 200 (-3) 3x + 100 = 160
3x + 6y = 240 x = 80 – 40 15x + 10y = 8000 3x = 160 - 100
-3x – 2y = -160 x = 40, (40, 20) -15x – 6y = -600 3x = 60
4y = 80 4y = 200 x = 20, (20, 50)
y = 20 y = 50
Extreme Points:
(0,100): 2, 000(0) + 2, 000(100) = Php.200, 000.00
(20, 50): 2, 000(20) + 2, 000(50) = Php.140, 000.00
(40, 20): 2, 000(40) + 2, 000(20) = Php.120, 000.00 Lowest Cost
(80, 0): 2, 000(80) + 2, 000(0) = Php.160, 000.00
IV. CONCLUSION
The Epsilon Company should operate 40 days in MINE A and 20
days in MINE B to achieve the lowest cost of Php.120, 000.00.
JAZZMINE M. DALANGPAN
2020-08-0017 │ ACC 201
LINEAR PROGRAMMING MANSCI
10.18.21 QUIZ # 1
3. Minimize: Zj = 24x + 28y
Subject to:
X≥8
Y ≥ 10
X + y ≥ 30
5x + 4y ≥ 200
x, y ≥ 0
I. FORMULATION
X≥8 Y ≥ 10 x + y ≥ 30 5x + 4y ≥ 200
X=8 Y = 10 X + y = 30 5x + 4y = 200
(8, 0) (0, 10) If x = 0, y =? If x = 0, y =?
y = 30, (0, 30) 4y = 200
y = 50, (0, 50)
If y = 0, x =?
x = 30, (30, 0) If y = 0, x =?
5x = 200
x = 40, (40, 0)
II. GRAPH
100
LEGENDS:
90
X≥8
80
EXTREME Y ≥ 10
70 POINTS x + y ≥ 30
60
5x + 4y ≥ 200
50
FEASIBLE
40 REGION
30
20
10
10 20 30 40 50 60 70 80 90 100
90
JAZZMINE M. DALANGPAN
2020-08-0017 │ ACC 201
LINEAR PROGRAMMING MANSCI
10.18.21 QUIZ # 1
X=8 Y = 10
5x + 4y = 200 5x + 4y = 200
5(8) + 4y = 200 5x + 4(10) = 200
40 + 4y = 200 5x + 40 = 200
4y = 200 – 40 5x = 200 – 40
4y = 160 5x = 160
y = 40, (8, 40) x = 32, (32, 10)
Extreme Points:
(8, 40): 24(8) + 28(40) = Php.1, 312.00
(32, 10): 24(32) + 28(10) = Php.1, 048.00 Lowest Cost
JAZZMINE M. DALANGPAN
2020-08-0017 │ ACC 201
LINEAR PROGRAMMING MANSCI
10.18.21 QUIZ # 1
4. Maximize: Zj = 25x + 19y
Subject to:
X + y ≤ 10
2x + 3y ≤19
X≤8
Y≤6
X, y ≥ 0
I. FORMULATION
x + y ≤ 10 2x + 3y ≤ 19 x≤8 Y≤6
x + y = 10 2x + 3y = 19 x=8 Y=6
If x = 0, y =? If x = 0, y =? (8, 0) (0, 6)
y = 10, (0, 10) 3y = 19
y = 6.3, (0, 6.3)
If y = 0, x =?
x = 10, (10, 0) If y = 0, x =?
2x = 19
X = 9.5, (9.5, 0)
II. GRAPH
10
LEGENDS:
9
x≤8
8
EXTREME y≤6
7
POINTS 2x + 3y ≤ 19
6
x + y ≤ 10
5
4 FEASIBLE
3 REGION
2
1 2 3 4 5 6 7 8 9 10
JAZZMINE M. DALANGPAN
2020-08-0017 │ ACC 201
LINEAR PROGRAMMING MANSCI
10.18.21 QUIZ # 1
Y=6 x=8
2x + 3y = 19 2x + 3y = 19
2x + 3(6) = 19 2(8) + 3y = 19
2x + 18 = 19 16 + 3y = 19
2x = 19 – 18 3y = 19 – 16
2x = 1 3y = 3
x = 0.2, (0.2, 6) y = 1, (8, 1)
Extreme Points:
(0, 6): 25(0) + 19(6) = Php.114.00
(0.2, 6): 25(0.2) + 19(6) = Php.119.00
(8, 1): 25(8) + 19(1) = Php.219.00 Highest Profit
(8, 0): 25(8) + 19(0) = Php.200.00
JAZZMINE M. DALANGPAN
2020-08-0017 │ ACC 201
