Scribd
Upload
627 views

Asuncion, Alwin Linear Programming Graphical Methods

1. The company can produce two products, A and B, using two processes. A linear programming model is formulated to maximize profit with constraints on processing hours. The optimal solution produces 10 units of A and 1.25 units of B for a maximum profit of ₱132.50. 2. A calculator company produces two models at two factories. A linear programming model is formulated to minimize production costs with constraints on daily production capacities. The minimum cost of ₱5,250 is achieved by operating Factory A for 1.9 days and Factory B for 3.3 days. 3. A dog food company must mix 700 pounds of ingredients with constraints on the amounts of

Uploaded by

Alwin Asuncion
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
627 views

Asuncion, Alwin Linear Programming Graphical Methods

1. The company can produce two products, A and B, using two processes. A linear programming model is formulated to maximize profit with constraints on processing hours. The optimal solution produces 10 units of A and 1.25 units of B for a maximum profit of ₱132.50. 2. A calculator company produces two models at two factories. A linear programming model is formulated to minimize production costs with constraints on daily production capacities. The minimum cost of ₱5,250 is achieved by operating Factory A for 1.9 days and Factory B for 3.3 days. 3. A dog food company must mix 700 pounds of ingredients with constraints on the amounts of

Uploaded by

Alwin Asuncion
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Asuncion, Alwin C.

BSED-MATHEMATICS 2A
1. A company manufactures two types of products, A and B. Each product uses two processes, I and II. The
processing time per unit of product A on process I is 6 hours and on the process II is 5 hours. The processing
time per unit of product B on process I is 12 hours and on process II is 4 hours. The maximum number of
hours available per week on process I and II are 75 and 55 hours respectively. The profit per unit of selling A
and B are Rs. 12 and Rs. 10 respectively.
a. Formulate a linear programming model so that the profit is maximized.
b. Solve the problem graphically and determine the optimum values of product A and B.

Solution:
Let A= product A on process I
B= product B on process II

Product Product A on process I Product B on process II Profit per unit


A 6 5 12
B 12 4 10
Hours per week 75 55

Objective function

𝑃 = 12𝑋1 + 10𝑋2

Constraint
6𝑋1 + 12𝑋2 ≤ 75
5𝑋1 + 4𝑋2 ≤ 55
𝑋1 , 𝑋2 ≥ 0

Getting the value 𝑋1 𝑎𝑛𝑑 𝑋2 by substituting into 0.


6𝑋1 + 12𝑋2 = 75 6𝑋1 + 12𝑋2 = 75
6𝑋1 + 12(0) = 75 6(0) + 12𝑋2 = 75
𝑋1 = 12.5 𝑋2 = 6.25

(12.5,0) (0,6.5)

5𝑋1 + 4𝑋2 ≤ 55 5𝑋1 + 4𝑋2 = 55


5𝑋1 + 4(0) = 55 5(0) + 4𝑋2 = 55
𝑋1 = 11 𝑋2 = 13.75

(11,0) (0,13.75)

Solve for the value of intersection using system of inequality.

6𝑋1 + 12𝑋2 = 75 6𝑋1 + 12𝑋2 ≤ 75


−3(5𝑋1 + 4𝑋2 = 55) 6(10) + 12𝑋2 = 75

6𝑋1 + 12𝑋2 = 75 60 + 12𝑋2 = 75


12𝑋1 75
−15𝑋1 − 12 𝑋2 = −165
12
= 12
−9𝑋1 −165
= 𝑋2 = 1.25
−9 −9
𝑋1 = 10
Finding optimum solution

Vertices Objectives function


(11,0) 12(11) + 10(0) = 132
(0,6.5) 12(0) + 10(6.5) = 65
(10, 1.25) 12(10) + 10(01.25) = 132.5

The maximum Profit is 132.5

2. A calculator company produces two models of calculator at two different factories. Factory A can produce
140 scientific calculators and 25 graphing calculators per day. Factory B can produce 60 scientific and 90
graphing calculators per day. It cost $1200 per day to operate Factory A and $900 per day to operate Factory
B. If the company need to produce 460 scientific calculators and 340 graphing calculators for a big order, find
the minimum cost to produce this order.

Solution:
A= Days of Factory A is operated
B= Days of Factory B is operated

Objectives:
Z= 1200A + 900A

Constraints:
140𝐴 + 60𝐵 ≥ 460
25𝐴 + 90𝐵 ≥ 340
𝐴≥0
𝐵≥0

Getting the value 𝑋1 𝑎𝑛𝑑 𝑋2 by substituting into 0.

140𝐴 + 60𝐵 ≥ 460; (3.3,0), (0, 7.7)


25𝐴 + 90𝐵 ≥ 340; (13.6,0), (0, 3.8)

Find the coordinates of intersection using system of Inequality.


25(140𝐴 + 60𝐵 = 460)
−140(25𝐴 + 90𝐵 = 340)
3500𝐴 + 1500𝐵 = 11500
−3500𝐴 − 12600𝐵 = −47600
−11100𝐵 −36100
=
−11100 −11100

𝐵 = 3.3

140𝐴 + 60(3.3) = 460


140𝐴 + 198 = 460
140𝐴 = 460 − 198
140𝐴 262
=
140 140
𝐴 = 1.9
The coordinate is (1.9, 3.3)

Finding the optimum solution


Vertices Objective Z= 1200A + 900A
(0, 7.7) 1200(0) + 900(7.7) = 6930
(1.9, 3.3) 1200(1.9) + 900(3.3) = 5250
(13.6, 0) 1200(3.6) + 900(0) = 16320
The minimum cost is 5,250 with the coordinate of (1.9, 3.3)
3. B-meg company wants to mix exactly 700 pounds of a special kind of dog food. There are two principal
ingredients in the mixture, both source of protein 𝑃1 𝑎𝑛𝑑 𝑃2 . The first source of protein, 𝑃1 cost ₱50 a
pound and ₱80 per pound. Chemical constraints dictate that the mixture contain not more than 500 pounds
of 𝑃1 and must contains at least 300 pounds of 𝑃2 . How many pounds of each ingredient must be utilize in
order to minimize the cost?

Objective:
Z= 50X+ 80Y

Constraint
𝑋 ≤ 500; (500,0), (500, 700)
𝑌 ≥ 300; (0,300), (700, 300)
𝑋 + 𝑌 ≤ 700; (700,0), (0, 700)
Graph of the constraint

800

700
a
600

500

400

300 b d

200 c
100

0
0 100 200 300 400 500 600 700 800

Find the optimum solution


Substitiute the coordinate in the objective function
POINT A
X 0
Y 700
Z 56000

POINT B X Y
C2 0 1 ≥ 300 X= 400
C3 1 1 ≤ 700 Y= 300
Z= 44000

POINT C X Y
C2 1 0 ≤ 500 X= 500
C3 1 1 ≤ 300 Y= 200
Z= 41000

POINT
D X Y
C1 1 0 ≤ 500 X= 500
C2 0 1 ≥ 300 Y= 300
Z= 49000
X= 500 source of protein 𝑃1
Y= 200 source of protein 𝑃2
The minimum cost 41,000 pounds.

Reference book:
- Quantitative Techniques for Management
- Quantitative for business

You might also like