Professional Documents
Culture Documents
Lesson #22
Productivity Tip: Set achievable work goals. Now you achieved to finish all the modules. Setting yourself a range of
goals is the perfect way to motivate yourself. Focus on SMART goals, which are: Specific, Measurable, Attainable,
Relevant and Time-bound.
A. LESSON PREVIEW/REVIEW
Introduction (2 mins)
Finite math teaches you how to use basic mathematic processes to solve problems in business and finance.
For example, you can use linear programming to stay within a budget. When you’re dealing with money, you
want a maximum value if you’re receiving cash. But if you’re on a tight budget and have to watch those money,
then you’re concerned with minimizing your expenses. The following is a minimization problem dealing with
saving money on supply.
You’re on a special diet and know that your daily requirement of five nutrients is standard and you are to
choose from two supplements: Vega Vita and Happy Health. The table below shows the content for each nutrient
per tablet. How many of each tablet should you take each day to meet your minimum requirements while
spending the least amount of money?
With all the information organized into the table, you can solve for the number of tablets that will minimize your
cost using linear programming.
B. MAIN LESSON
Activity 2: Content Notes (13 mins)
Dual Problems: Every standard minimization linear programming problem is associated with a standard
maximization problem (and vice versa). The original problem is called the primal problem and the
associated problem is called the dual problem.
The Fundamental Theorem of Duality: A primal problem has a solution if and only if the corresponding
dual problem has a solution.
Solution: (Jump to this step 3 since all functions are given: (objective, explicit and implicit)
Step 3. Solve for feasible vertices algebraically or graphically using the functions.
Minimize monthly cost 𝐶 = 𝑃50𝑥 + 60𝑦
Subject to: 𝑥 + 2𝑦 ≥ 10
3𝑥 + 2𝑦 ≤ 18
𝑥≥2
𝑥, 𝑦 ≥ 0
Step 4: Substitute the feasible vertices to the function to get the maximum
Minimize: 𝐶 = 50𝑥 + 60𝑦
50(2) + 60(6) = ₱460
50(2) + 60(4) = ₱340
50(4) + 60(3) = ₱380
Step 5. Decision
X = 2 units and Y = 4 units and the Minimum Cost of ₱340
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 pharmacist produces a drug from two ingredients. Each ingredient contains the same three
antibiotics in different proportions. Each ingredient A produced results ₱80 in cost; each ingredient B results
₱50 in cost. The production of the antibiotics is dependent on the availability of limited resources. The resource
requirements for the production are as follows.
Problem #2. Solve the given Linear Programming problem (Minimization Involving Mixed Constraints)
Minimize: 𝐶 = 100𝑥 + 80𝑦
Subject to 𝑥+𝑦≥5
2𝑥 + 2𝑦 ≤ 20
𝑥≥2
𝑥≤7
𝑥, 𝑦 ≥ 0
“Check your answers against the Key to Corrections found at the end of this SAS.
Write your score on your paper.”
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 parts were challenging for you to do? Why do you think was it challenging for you?
_________________________________________________________________________________
_________________________________________________________________________________
2. In a scale of 1-5, 1 being low and 5 being high, how successful were you in meeting today’s lesson
objectives? Why do you say so? What factors contributed to this? What changes, if any should you do
for your next learning session.
_________________________________________________________________________________
_________________________________________________________________________________
FAQs
1) Why is it called linear programming?
One of the areas of mathematics which has extensive use in combinatorial optimization is called linear
programming (LP). It derives its name from the fact that the LP problem is an optimization problem in
which the objective function and all the constraints are linear.
KEY TO CORRECTIONS
Activity 3. (5 points per problem)
Problem #1. Let X be the quantity of Ingredient A and Y be the quantity of Ingredient B.
Problem #2.
Vertices are (5, 0), (7, 0), (2, 3), (2, 8) and (7, 3) lying on the feasible region.
Minimize: 𝐶 = 100𝑥 + 80𝑦
100(5) + 80(0) = 500
100(7) + 80(0) = 700