MEC 486: Project Planning

Linear Programming
Applications on Graphical Method

Prof. Mohamed Ibrahim

 Example 1
Max z = 3x + 2y x 0 9
Subject to: 2x + y ≤ 18
y 18 0
2x +3y ≤ 42
3x + y ≤ 24
x≥0,y≥0 x 0 21
y 14 0

x 0 8
y 24 0
 Point @ Objective Function
Z= (8, 0) = 24
Z= (6, 6) = 30
Z= (3, 12) = 33 *
Z= (0, 14) = 28
 Example 2
Max z = 3x + 2y
x 0 50
Subject to: 2x + y ≥ 100
y 100 0
x + y ≤ 80
x ≤ 40
x 0 80
x≥0,y≥0
y 80 0

x 40 40
y 0 100
 Point @
Z= (40, 20) 160
Z= (40, 40) 200 *
Z= (20, 60) 180
 Example
A healthy company manufactures two types of foods: Meaties and Yummies.
Each package of Meaties contains 2 pounds of cereal and 3 pounds of meat;
each package of Yummies contains 3 pounds of cereal and 1.5 pounds of
meat. Healthy believes it can sell as much of each dog food as it can make.
Meaties sell for $2.80 per package and Yummies sell for $2.00 per package.
Healthy’s production is limited in several ways. First, Healthy can buy only up
to 400,000 pounds of cereal each month at $0.20 per pound. It can buy only
up to 300,000 pounds of meat per month at $0.50 per pound. In addition, a
special piece of machinery is required to make Meaties, and this machine has
a capacity of 90,000 packages per month. The variable cost of blending and
packing the dog food is $0.25 per package for Meaties and $0.20 per package
for Yummies. Suppose you are the manager of the Healthy Company. Your
salary is based on division profit, so you try to maximize its profit. How should
you operate the division to maximize its profit and your salary?
 Solution
• M number of packages of Meaties to make each month
• Y number of packages of Yummies to make each month
• The profit per package for each dog food is computed as follows:
• Objective function:
Max. z = 0.65 M + 0.45 Y
Constraints:
2 M + 3 Y ≤ 400,000 (Cereal limitation)
3 M + 1.5 Y ≤ 300,000 (Meat limitation)
M ≤ 90,000 (machine limitation)
M, Y ≥ 0
• Solve & send it before 12/4 on LMS
Thank you