MODULE

4
MODULE G ALS FLEX Course Material
College of Business and
Accountancy
Linear Programming
Graphical Method
(Maximization)

• Management Science
LESSON
#4
LEARNING
OUTC MES
Linear Programming
Solve LP model in maximization
using graphical method.
Graphical Method
Gain proficiency in finding
the feasible region of a Linear
(Maximization)
Programming model.
Formulate the decision of Linear
Programming problem.
Linear Programming
Graphical Method
(Maximization)
Definition of Terms:
Feasible Region
set of values for the decision variables that satisfy all the constraints in an optimization problem.
Optimal Solution
feasible solution where the objective function reaches its maximum or minimum value over the feasible
region.
Vertices of the feasible region
corners or points of the feasible region where lines 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. 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.
a. If it is maximization choose the vertex that will give the highest value (profit, sales).
b. If it is minimization choose the vertex that will give the lowest value ( cost of production or
operation).
Illustrative example 1:
 Illustrative Example 1:
Ideal home Furniture Company manufactures two products: tables and chairs, which must be
processed through assembly and finishing departments. Assembly department is available for 60
hours in every production period while the finishing department is available for 48 hours of work.
Manufacturing one table requires 4 hours in the assembly and 2 hours in the finishing. Each chair
requires 2 hours in the assembly and 4 hours in the finishing. The profit per table is P1,800 and
P1,000 for each chair.
a. Formulate the LP model.
b. If the company wants to maximize total profit contribution, how many tables and chairs should
it manufacture?
c. What profit contribution can the company earn on these production quantities?
d. How many hours of production time will be scheduled for each operation?
e. What is the slack time for each operation?

Note: slack time is the unused time in the operations.

Recall of Step 1 in Formulating the Linear Programming Model.
Table (x) Chair (y)) Time Availability

Assembly 4 2 60 hours
Finishing 2 4 48 hours
Profit/unit P1,800 P1,000

Linear Programming Model:

Maximize: Z = P1,800x + P1,000y objective function
Subject to: 4x + 2y ≤ 60 hours 1st constraint (assembly)
2x + 4y ≤ 48 hours 2nd constraint (finishing)
x, y ≥ 0

Why is it that the relational symbol ≤ is used in the 1st and the 2nd constraint?
Given the linear programming model of Ideal Home problem below we can proceed now to Step 2 of
solving LP maximization using graphical method.

Maximize: Z = P1,800x + P1,000y

Subject to: 4x + 2y ≤ 60 hours
2x + 4y ≤ 48 hours
x, y ≥ 0
Step 2: Graph the constraints and find the area of the feasible solution.:
Solve the intercepts of both constraints.
Costraints1: 4x + 2y ≤ 60 express to equation
4x + 2y = 60 solve for the x and y intercepts.
If x = 0, substitute 0 in place of x and solve for y.
4(0) + 2y = 60
X 0 15
2y = 60 dividing both side by 2
2 2 y 30 0
y = 30 y-intercept (0, 30)
If y = 0 substitute 0 in place of y and solve for x.
4x + 2y = 60 4x = 60 x = 15 x-intercept (15, 0)
4x + 2(0) = 60 4 4
• Constraint 2: 2x + 4y ≤ 48
• 2x + 4y = 48
If x = 0, substitute 0 in place of x and solve for y.
2(0) + 4y = 48
4y = 48 dividing both side by 4
4 4 x 0 24
y = 12 y-intercept (0, 12) y 12 0
If y = 0 substitute 0 in place of y and solve for x.
2x + 4y = 48 2x = 48 x = 24 x-intercept (24, 0)
2x + 4(0) = 48 2 2
• Construct the rectangular coordinate system, plot the ordered pairs and locate the intercepts for both
constraints.
y-axis

• (0, 30) 30

25

4x + 2y = 60
x=0 20

15
B
A
B Area of the Feasible region
• (0, 12) 10
D (12,6)

y= 0
5 2x + 4y = 48
B x-axis
5 10 15 20 25 30
• Step 3
• Determine the coordinates of the vertices of the feasible region.
• Locate point D by using the lines of the 2 equations that forms point D.
• Using elimination method:
• 4x + 2y = 60 Equation 1 Choose the variable that can be easily eliminated
• 2x + 4y =48 (-2) Equation 2 Eliminate x by multiplying equation 2 by (-2) bring
• down equation 1 then add.
• Equation 2; – 4x – 8y = –96
• Equation 1; 4x + 2y = 60
• –6y = –36 Divide both sides by 6
• –6 –6
• x=6
• Substitute 6 in place of y in any of the two equations then calculate the value of x.
• Using Equation 1.
• 4x + 2(6) = 60
• 4x + 12 = 60
• 4x = 60 – 12
• 4x = 48 dividing both sides by 4
• 4 4
• x = 12
• Therefore the coordinate of point D is (12, 6)
• Step 4:
• Substitute the coordinates of the vertices of the feasible region to the objective function.
• Test Area ABCD
• Z = P1,800 x + P1,000 y
• Point A(0, 0) P1,800 (0) + P1,000 (0) = 0
• Point B (0,12) P1,800 (0) + P1,000 (12) = P12,000
• Point D (12, 6) P1,800 (12) + P1,000 (6) = P27,600
• Point C (15, 0) P1,800 (15) + P1,000 (0) = P27,000

• Step 5: Formulate the decision.

• b. The company will produce x = 12 tables and y = 6 chairs
• c. The company will earn P27,600
• d. Schedule time per production.
• Constraint 1: 4x + 2y 4(12) + 2(6) 48 + 12 = 60 For constraint 1 the company should have 60
hours which is the time available for constraint 1
• Constraint 2:
• 2x + 4y
• 2(12) + 4(6)
• 24 + 24 = 48 The company should have 48 hours for the production
• of 12 tables and 6 chairs
• e. What is the slack time per operation?
• Note: Slack time is the unused time per operation.
• Formula: Slack time = Time available – time for the best combination that yields the highest profit.
• First operation or C1:
• Slack time = 60 hours – 60 hours used to produce 12 tables and 6 chairs
• Slack time = 0, which means no unused time. It uses all the available
• resources
• First operation or C2:
• Slack time = 48 hours – 48 hours used to produce 12 tables and 6 chairs
• Slack time = 0, which means no unused time. It uses all the available
• resources
• Example # 2:
• RCS Sporting Equipment Company, makes two different types of baseball gloves for export. A
regular model and special model. The firm has allocated 54,000 minutes of production time in the
cutting department, 18,000 minutes was allocated in the finishing department and 6,000 minutes
was allocated in the packaging and shipping department. The production time requirement and the
profit contribution per glove are given in the table below.
Department Regular Model (x) Special Modelhing (y)
Cutting and Sewing 60 minutes 90 minutes
Finishing 30 minutes 20 minutes
Packaging and Shipping 7.5 minutes 15 minutes
Profit per Glove $50 $80

Assuming that the company is interested in maximizing the total profit contribution.
1. Formulate the linear programming model.
2. How many gloves of each model should the RCS company manufacture in order to maximize total
profit contribution?
3. How much is the total profit contribution of RCS Company with the given production quantities?
4. How many minutes of production time will be scheduled in each department?
5. What is the slack time in each department?
Example # 2:
Step 1 in Formulating the Linear Programming Model.
Department Regular Model (x) Special Model (y)
Cutting and Sewing 60 minutes 90 minutes
Finishing 30 minutes 20 minutes
Packaging and Shipping 7.5 minutes 15 minutes
Profit per Glove $50 $80
Linear Program Model:
Maximize: Z = $50x + $80y Objective function
Subject to: 60x + 90y ≤ 54,000 minutes 1st constraint (Cutting and Sewing)
30x + 20y ≤ 18,000 minutes 2nd constraint (Finishing)
7.5x + 15y ≤ 6,000 minutes 3rd constraint (Packing and Shipping)
x, y ≥ 0
• Solution sheet: (Using Pen Tablet).
• Solution sheet: (Using Pen Tablet).
• Solution sheet: (Using Pen Tablet).
• Example #3
• ABC Inc., is a small firm that produces two products: a fuel additive and a
solvent base. The fuel additive is sold to oil companies and it is used in the
Production of gasoline and related fuels. The solvent base is sold to a variety
Of chemical firms and it is used in both homes and industrial cleaning
products. The three raw materials are blended to form the fuel additive and
solvent base. A ton of fuel additive is a mixture of 0.4 tons of material 1 and
0.6 ton of material 3. A ton of solvent base is a mixture of 0.5 ton of material 1
0.2 ton of material 2, and 0.3 ton of material 3. The amount available per
production period is 20 tons for material 1, 5 tons for material 2, and 21 tons
for material 3. ABC makes $40 for every ton of fuel additive produced and
$30 for every ton of solvent base produced.
• Solution sheet: (Using Pen Tablet).
• A. Formulate the linear programming model
• B. Find the optimal solution using graphical method. How many each of the
two products should be produced?
• C. How much is the profit can the company earn with the given production
quantities?
• D. How many tons of production will be scheduled in each materials?
• E. What is the slack in each materials?
• Solution sheet: (Using Pen Tablet).
• Solution sheet: (Using Pen Tablet).
KEEP SAFE EVERYONE
END