5

Linear Programming
Minimization
 Pizza Star Co.
Pizza Star Co. is considering buying two different brands of
cheese and blending them to provide a good, low-cost pizza

Composition of Cheese per unit

of Pizza Type
Minimum daily
requirement of
Pizza Type Cheese 1 Cheese 2 cheese
Blue Ocean (A) 5 10 90
Red Fire (B) 4 3 48
Greeny (C) 0.5 0 1.5
Cost Per Kg. $2 $3
Let’s X1 = number of Kg. of cheese brand 1
X2 = number of Kg. of cheese brand 2
 Equation form
Minimize 2X1 + 3X2

Subject to

5X1+ 10X2 ≥ 90

4X1+ 3X2 ≥ 48

0.5X1 ≥ 1.5

X1, X2 ≥ 0
 Pizza Star Co
Using the corner point method
•First:
we construct the graph
•Second:
highlight the feasible solution region (upper
corner) and find the optimal solution that lie at
one of the corner points)
 Pizza Star Co
To draw the graph, plot the constraint line

5X1+ 10X2 ≥ 90 X1= 18 , X2= 9

4X1+ 3X2 ≥ 48 X1= 12 , X2= 16

0.5X1 ≥ 1.5 X 1= 3
 Pizza Star Co
To draw the graph, plot X2
the constraint line
–

5X1+ 10X2 ≥ 90
X1= 18 , X2= 9 20 – Equation C X1= 3

Q of Brand 2 15 – Feasible Region

4X1+ 3X2 ≥ 48 X1=
12 , X2= 16 K
10 –
Equation B X1= 12 , X2= 16

0.5X1 ≥ 1.5 5– Equation A X1= 18 , X2= 9

L
X1= 3 M
| | | | | |
0–
5 10 15 20 25 X1
Q of Brand 1
 Pizza Star Co
 Finding the coordination of K, L, and M points
 Pizza Star Co
• We solve for the values of the three corner points
• Point K is the intersection of equations or constraints C
and B
4X1 + 3X2 = 48
X1 = 3
• Substituting 3 in the first equation,
• we find X2 = 12 + 3X2 = 48, then X2= (48-12)/3 = 12
 Pizza Star Co
• Point L is the intersection of ingredient constraints
• A and B B 4X1 + 3X2 = 48
• A 5X1+ 10X2 = 90
• Solving for point b with basic algebra
• Multiply B x 10 40X1 + 30X2 = 480
• Multiply A x -3 -15X1 - 30X2 = -270
• Add the equations 25X1 = 210 So we find X1 = 8.4
•
• X2 = 4x8.4 + 3X2 = 48
•
• X2 =(48-33.6)/3 = 4.8
 Pizza Star Co
• Point M is the intersection of ingredient constraint A
when X2 = 0
A 5X1+ 10X2 = 90
• when X2 = 0 X1 = 18
 Pizza Star Co
Points X1 X2 Cost = 2X1 + 3X2
K 3 12 Cost = 2(3) + 3(12) = 42
L 8.4 4.8 Cost = 2(8.4) + 3(4.8) = 31.2
M 18 0 Cost = 2(18) + 3(0) = 36

 The lowest cost solution is to purchase:

 8.4 Kg. of cheese brand 1 and 4.8 Kg. of cheese brand 2
with cost of $ 31.2