LESSON

#4
LEARNING
OUTC MES
Linear Programming
Solve linear program
problems in minimization
Graphical Method
using graphical method.
Linear Programming
Graphical Method
(Minimization)
What is optimization?
Definition of Terms:
Feasible Region
is a set of values for the decision variables that satisfies all of the constraints in an
optimization problem.
Optimal Solution
is a feasible solution where the objective function reaches its maximum or minimum
value of the objective function over the feasible region.
Vertices of the feasible region are corners or points where lines of feasible region meet.
Example:
Vertices
• Solving linear programming Problems using Graphical Method.
• Steps:
• 1. Formulate the Linear Program model.
• 2. Graph the constraints ( inequalities or equations) and shade the area of the
feasible solution.
• 3. Solve and determine the coordinates of the vertices of the feasible region.
• 4. Substitute the coordinates of the vertices of the feasible region to the objective
function.
• 5. Formulate the decision. If it is maximization choose the vertex that will give
the highest value (profit), whereas if it is minimization choose the vertex that will
give the lowest value ( cost).
Illustrative example:
The poultry farmer must supplement the vitamins he buys. He is considering two supplements, each of
which contains the feed required but in different amounts. He must meet or exceed the minimum vitamin
requirements. The vitamin content per gram of the supplements is given in the following table:
Vitamin Supplement 1 (x) Supplement 2 (y)
A 2 1
D 2 9
E 2 3
Supplement 1 costs P5 per gram and Supplement 2 costs P4 per gram.
The feed must contain at least 12 units of Vitamin A, at least
36 units of Vitamin D, and at least 24 units of Vitamin E.
a. Formulate the linear programming model.
b. Use the procedure to determine the feasible region. What are the
coordinates of the extreme points?
c. Compute the total cost of each extreme point.
d. What is the optimal solution?
Solution:
Prepare a summary table.
Vitamins Supplement 1 Supplement 2 Requirements
(x) (y)
A 2 1 ≥ 12
D 2 9 ≥ 36
E 2 3 ≥ 24
Cost per gram P5 P4

Note: For at least use ≥ .

For at most use ≤ .
Step 1: Formulate the linear program.
• LP Model
• To minimize C = P5x + P 4y Note: Use C to represent cost.
• Subject to: 2x + y ≥ 12 Constraint of Vitamin A
• 2x + 9y ≥ 36 Constraint of Vitamin D
• 2x + 3y ≥ 24 Constraint of Vitamin E
• x, y ≥ 0
• Solve for the x–intercept and y–intercept of the three constraints.
C1: 2x + y = 12 let x = 0, replace x with 0, so we have 2(0) + y = 12, then y = 12, (0, 12) y-intercept
let y = 0, replace y with 0, so we have 2x + 0 = 12, 2x = 12 divide both sides by 2
then x = 6, (6, 0) x-intercept
C2: 2x + 9y = 36 let x = 0, replace x with 0, so we have 2(0) + 9y = 36, 9y = 36 divide both sides by 9
then y = 4, (0, 4) y-intercept
let y = 0, replace y with 0, so we have 2x + 9(0) = 36, 2x = 36 divide both sides by 2
then x = 18, (18, 0) x-intercept
C3: 2x + 3y = 24 let x = 0, replace x with 0, so we have 2(0) + 3y = 24, 3y = 24divide both sides by 3
then y = 8, (0, 8) y-intercept
let y = 0, replace y with 0, so we have 2x + 3(0) = 24, 2x = 24 divide both sides by 2
then x = 12, (12, 0) x-intercept
Step 2: Graph the constraints and find the area of the feasible solution:

The line representing the Constraints are all

Demand line and the Inequality symbol are ≥
Therefore the solution set will be from the points (0, 12) (0, 12
A
on line going up. 2x + y = 12

(3, 6) B 2x + 3y = 24
C
(9, 2) C 2x + 9y = 36
A
D
(18, 0)
Step 3:
Solve and determine the coordinates of the vertices of the feasible region
Locate Point B: Point B is the intersection of the two lines (red and green).
We can make use of elimination method.
2x + y = 12 Equation 1
2x + 3y = 24 Equation 2
We can eliminate x by multiplying Equation 1 by – 1
(2x + y = 12) – 1 Equation 1
– 2x – y = – 12 Then add Equation 2
2x + 3y = 24 Area of the feasible region
(0, 12) A
2y = 12 dividing both sides by 2
2x + y = 12
y=6
Substitute y = 6 to Equation 1
(3, 6) B 2x + 3y = 24
2x + y = 12 2x = 6
C
2x + 6 = 12 2 2 (9, 2) C 2x + 9y = 36
2x = 12 -6 x=3 A
D
(18, 0)
Therefore Point B is (3, 6)
Locate Point C is the intersection of the two lines (red and green).
We can make use of elimination method.
2x + 9y = 36 Equation 1
2x + 3y = 24 Equation 2
We can eliminate x by multiplying Equation 1 by – 1 Y-axis
(2x + 9y = 36) – 1 Equation 1
– 2x – 9y = – 36 Then add Equation 2
2x + 3y = 24
– 6y = – 12dividing both sides by – 6
A (0, 12)
y=2 Area of the feasible region
2x + y = 12
Substitute y = 2 to Equation 1
2x + 9(2) = 36 2x = 18 B 2x + 3y = 24
2x + 18 = 36 2 2 C
2x = 36 – 18 x=9 C 2x + 9y = 36
(18, 0
Y=0 A
Therefore Point C is (9, 2) D
X=0
Step 4:
Substitute the coordinates of the vertices of the feasible region to the objective
function.
Test area A, B, C, D
To minimize: C = P 5x + P 4y
Point A ( 0, 12) P 5(0) + P 4(12) = 48
Point B (3, 6) P 5(3)+ P 4(6) = 15 + 24 = 39
Point C (9, 2) P 5(9) + P 4(2) = 45 + 8 = 53
Point D (18, 0) P 5(18) + P 4(0) = 90
Step 5: Formulate the decision.
The farmer must use:
x = 3 grams of supplement 1
y = 6 grams of supplement 2
The lowest cost is P39
Answering the requirements of:
a. LP Model
• To minimize C = P5x + P 4y
• Subject to: 2x + y ≥ 12 Constraint of Vitamin A
• 2x + 9y ≥ 36 Constraint of Vitamin D
• 2x + 3y ≥ 24 Constraint of Vitamin E
• x, y ≥ 0
b. The area of the feasible solution.
Area ABCD coordinates of the extreme points are;
Point A (0, 12)
Point B (3, 6)
Point C (9, 2)
Point D (18, 0)
c. Compute the total cost of each extreme point using the objective function.
To minimize: C = P 5x + P 4y
Point A ( 0, 12) P 5(0) + P 4(12) = 48
Point B (3, 6) P 5(3)+ P 4(6) = 15 + 24 = 39
Point C (9, 2) P 5(9) + P 4(2) = 45 + 8 = 53
Point D (18, 0) P 5(18) + P 4(0) = 90

d. What is the optimal solution?

The optimal solution is:
x = 3 grams of supplement 1
y = 6 grams of supplement 2
Lowest Cost is P39.
• Assignment: (10 points)
• Planters Incorporated has determined the minimum requirement of the amount of certain chemical to
grow rice successfully. The individual contents and costs of each fertilizer are given the following
table: Chemical Fertilizer 1 (x) Fertilizer 2 (y) Minimum
Requirement
Chemical A 2 units per bag 3 units per bag 36 units
Chemical B 4 units per bag 2 units per bag 40 units
Chemical C 1 unit per bag 1 unit per bag 16 units
Cost P200 per bag P100 per bag
Find out how many bags of each type should the farmer buy in order to minimize his expenses for the
fertilizer. How much is the lowest cost?
• KEEP SAFE EVERYONE
END