Sas 21 Mat 152 - FLM
Sas 21 Mat 152 - FLM
Lesson #21
Productivity Tip: Create a work routine. One of the most effective ways to work more productively is to get into a
routine where you wake up, work and have breaks at around the same time each day.
A. LESSON PREVIEW/REVIEW
Introduction (2 mins)
Linear programming is used for obtaining the most optimal solution for a problem with given constraints.
In linear programming, we formulate our real-life problem into a mathematical model. It involves an objective
function, linear inequalities with subject to constraints.
Many mathematical models designed to solve real world problems in business and economics involve
finding either the maximum or the minimum value of a function, subject to certain limitations. As a matter of fact,
these problems arise in the cases where available to resources are limited or cannot be fully utilized. In this
module, the primary concern is on solving a particular real-world problem by setting up its corresponding
mathematical model. It will be focus on maximization problems. You identify the parts on how to solve linear
programming, graph maximization problems and give decision rule.
Imagine you are an owner of a huge bakeshop and managing 200 people. Suddenly, you got an offer of
purchasing a machine that can do the job of your 200 employees. Would you take it? Why or Why not?
2. What is a maximization
problem?
B. MAIN LESSON
Activity 2: Content Notes (13 mins)
Linear Programming is a method of dealing with decision problems that can be expressed as constrained
linear models. It will help managers to ideally develop a production schedule and an inventory policy that will
satisfy sales demand in the future period at the same time minimize the total production and inventory costs.
3. The function to be optimized in linear programming is called the objective function. This usually
refers to profit maximization or cost minimization. In linear programming problems, constraints
are given by inequalities (called inequality constraints).
4.
5. There are two types of constraints:
6. Structural Constraint is a limit on the availability of resources; it is also referred as explicit constraint.
Non-negativity constraint is the constraint that restricts all the variables to zero and positive solution; it
also referred as implicit constraint. Let’s take the linear programming model below.
Example. A firm manufactures 2 products, A and B. Each product is processed by 2 machines, 𝑀1 and 𝑀2 .
Each unit of type A requires 1 hour of processing by 𝑀1 and 2 hours in 𝑀2 and each unit of type B requires 3
hours on 𝑀1 and 1 hour on 𝑀2 . The profit on product A is ₱20 per unit and on product B is ₱30 per unit. If 𝑀1 is
available for 200 hours each month and 𝑀2 for 300 hours, how many units of each type can be manufactured in
one month in order to maximize the profits?
Solution:
Step 1. Create a summary table (if necessary).
Let x be the product A and y be the product B. Make a contingency table if necessary.
Product Machine 1 Machine 2 Profit
x → 1x → 2x → 20x
y → 3y → 1y → 30y
Availability 200 hours 300 hours
Step 3. Solve for feasible vertices algebraically or graphically using the equality functions above.
a) 𝑥 + 3𝑦 = 200 Let x = 0, y = 66.67 (0, 66.67) let y = 0, x = 200 (200, 0)
2𝑥 + 𝑦 = 300 Let x = 0, y = 300 (0, 300) let y = 0, x = 150 (150, 0)
(Choose the once closest to graphs origin since there are no other explicit constraints given.)
*selection varies depending on the functions
Thus, the feasible vertices are (0, 66.67), (150,0) and (140, 20).
(Or use graph to locate the feasible vertices easily, you may use https://www.desmos.com/calculator )
Step 4: Substitute the feasible vertices to the function to get the maximum
Maximize: 𝑃 = 20𝑥 + 30𝑦
20(0) + 30(66.67) = ₱2, 000.10
20(150) + 30(0) = ₱3, 000.00
20(140) + 30(20) = ₱3, 400.00
Step 5. Decision
Therefore, there are x = 140 units of product A and y = 20 units of product B.
Maximum profit of P3, 400.00
Activity 3: Skill-building Activities (with answer key) (18 mins + 2 mins checking)
Practice Exercises: Solve the given Linear Programming Maximization problem use the back pages of this
module or in a graphing paper.
Problem #1. A local boutique produced two designs of gowns A and B and has the following materials available:
18 square meters of cotton, and 20 square meters of silk, and 5 square meters of wool. Design A requires the
following: 3 square meters of cotton, 2 square meters of silk and 1 square meter of wool. Design B requires the
following: 2 square meters of cotton, 4 square meters of silk. If the Design A sells for ₱1,200 and Design B for
₱1,600, how many of each garment should the boutique produce to obtain the maximum amount of money?
Problem #2. Solve the given Linear Programming problem (Maximization Involving Mixed Constraints).
Maximize: 𝑃 = 30𝑥 + 60𝑦
Subject to: 6𝑥 + 3𝑦 ≥ 18
5𝑥 + 𝑦 ≤ 15
𝑥≥2
𝑥, 𝑦 ≥ 0
“Check your answers against the Key to Corrections found at the end of this SAS.
Write your score on your paper.”
Activity 4: What I Know Chart, part 2 (2 mins)
Instructions: Review the questions in the What I Know Chart from Activity 1 and write your answers to the
questions based on what you now know in the third column of the chart.
C. LESSON WRAP-UP
Activity 6: Thinking about Learning (5 mins)
A. Work Tracker
You are done with this session! Let’s track your progress. Shade the session number you just
completed.
1. What is one strategy that you’ve never tried before that you think will help you better understand the
lesson? Describe it.
_________________________________________________________________________________
_________________________________________________________________________________
2. Did you have challenges in today’s learning? How did you overcome those challenges?
_________________________________________________________________________________
_________________________________________________________________________________
FAQs
1) What are the problems of linear programming?
For a problem to be a linear programming problem, the decision variables, objective function
and constraints all have to be linear functions. If all the three conditions are satisfied, it is called
a Linear Programming Problem.
KEY TO CORRECTIONS
Activity 3: (5 points per problem)
Problem#1:
Step 1. Create a summary table (if necessary).
Materials Design A (x) Design B (y) Available
Cotton 3 2 18
Silk 2 4 20
Wool 1 0 5
Profit ₱1, 200 ₱1, 600
Step 3. Solve for feasible vertices algebraically or graphically using the equality functions above.
(a) 3𝑥 + 2 = 18 Let x = 0, y = 9 (0 , 9) and let y = 0, x = 6 (6 , 0)
2𝑥 + 4 = 20 Let x = 0, y = 5 (0 , 5) and let y = 0, x = 10 (10 , 0)
*note that 𝑥 ≤ 5
(b) Point of intersection of 3𝑥 + 2𝑦 ≤ 18 and 2𝑥 + 4𝑦 ≤ 20 , we have x = 4 and y = 3 ; (4 , 3)
(The graph)…
Step 4: Substitute the feasible vertices to the function to get the maximum
𝑃 = 1200𝑥 + 1600𝑦
1200(0) + 1600(5) = ₱8, 000
1200(4) + 1600(3) = ₱9, 600
1200(5) + 1600(1.5) = ₱8, 400
Step 5. Decision
There are x = 4 Design A gowns and y = 3 Designs B gowns with the Maximum Profit of ₱9,600.
Problem #2: Answer: There are x = 2 and y = 5 with the maximum value of 360
Activity 5. (5points)
Decision: Therefore, the coordinate (10, 0) will give the highest value of 60.
X = 10, Y = 0, P = 60